/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:32:57,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:32:57,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:32:57,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:32:57,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:32:57,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:32:57,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:32:57,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:32:57,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:32:57,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:32:57,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:32:57,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:32:57,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:32:57,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:32:57,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:32:57,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:32:57,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:32:57,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:32:57,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:32:57,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:32:57,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:32:57,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:32:57,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:32:57,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:32:57,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:32:57,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:32:57,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:32:57,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:32:57,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:32:57,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:32:57,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:32:57,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:32:57,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:32:57,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:32:57,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:32:57,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:32:57,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:32:57,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:32:57,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:32:57,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:32:57,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:32:57,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:32:57,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:32:57,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:32:57,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:32:57,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:32:57,281 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:32:57,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:32:57,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:32:57,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:32:57,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:32:57,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:32:57,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:32:57,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:32:57,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:32:57,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:32:57,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:32:57,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:32:57,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:32:57,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:32:57,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:32:57,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:32:57,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:32:57,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:32:57,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:32:57,597 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:32:57,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-11-06 22:32:57,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df3e3aa9/8232bbccd8254191a4371da605719fc5/FLAG6f3272c70 [2019-11-06 22:32:58,215 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:32:58,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-11-06 22:32:58,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df3e3aa9/8232bbccd8254191a4371da605719fc5/FLAG6f3272c70 [2019-11-06 22:32:58,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df3e3aa9/8232bbccd8254191a4371da605719fc5 [2019-11-06 22:32:58,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:32:58,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:32:58,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:32:58,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:32:58,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:32:58,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:58" (1/1) ... [2019-11-06 22:32:58,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c70f143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:58, skipping insertion in model container [2019-11-06 22:32:58,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:58" (1/1) ... [2019-11-06 22:32:58,538 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:32:58,602 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:32:59,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:32:59,133 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:32:59,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:32:59,294 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:32:59,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59 WrapperNode [2019-11-06 22:32:59,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:32:59,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:32:59,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:32:59,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:32:59,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (1/1) ... [2019-11-06 22:32:59,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:32:59,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:32:59,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:32:59,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:32:59,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (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-11-06 22:32:59,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:32:59,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:32:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:32:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:32:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:32:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:32:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:32:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:32:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:32:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:32:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:33:00,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:33:00,685 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:33:00,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:00 BoogieIcfgContainer [2019-11-06 22:33:00,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:33:00,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:33:00,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:33:00,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:33:00,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:32:58" (1/3) ... [2019-11-06 22:33:00,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231a97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:00, skipping insertion in model container [2019-11-06 22:33:00,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:59" (2/3) ... [2019-11-06 22:33:00,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231a97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:00, skipping insertion in model container [2019-11-06 22:33:00,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:00" (3/3) ... [2019-11-06 22:33:00,694 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-11-06 22:33:00,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:33:00,711 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:33:00,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:33:00,755 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:33:00,755 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:33:00,755 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:33:00,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:33:00,756 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:33:00,756 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:33:00,756 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:33:00,756 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:33:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-11-06 22:33:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-06 22:33:00,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:00,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:00,803 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1121979298, now seen corresponding path program 1 times [2019-11-06 22:33:00,819 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:00,819 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368125810] [2019-11-06 22:33:00,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:01,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368125810] [2019-11-06 22:33:01,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:01,270 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:33:01,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546747459] [2019-11-06 22:33:01,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:33:01,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:33:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:33:01,303 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-11-06 22:33:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:02,197 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-11-06 22:33:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:33:02,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-06 22:33:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:02,216 INFO L225 Difference]: With dead ends: 618 [2019-11-06 22:33:02,216 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:33:02,222 INFO L630 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-11-06 22:33:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:33:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:33:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:33:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-11-06 22:33:02,327 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 146 [2019-11-06 22:33:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:02,330 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-11-06 22:33:02,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:33:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-11-06 22:33:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:33:02,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:02,344 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:02,345 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash -74166087, now seen corresponding path program 1 times [2019-11-06 22:33:02,346 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:02,346 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218322581] [2019-11-06 22:33:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:02,768 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218322581] [2019-11-06 22:33:02,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:02,768 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:33:02,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101561249] [2019-11-06 22:33:02,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:33:02,772 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:33:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:02,772 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-11-06 22:33:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:03,456 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-11-06 22:33:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:33:03,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-11-06 22:33:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:03,461 INFO L225 Difference]: With dead ends: 721 [2019-11-06 22:33:03,462 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:33:03,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:33:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:33:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:33:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-11-06 22:33:03,477 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 154 [2019-11-06 22:33:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:03,478 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-11-06 22:33:03,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:33:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-11-06 22:33:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-06 22:33:03,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:03,480 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:03,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash 742954861, now seen corresponding path program 1 times [2019-11-06 22:33:03,481 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:03,481 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221735129] [2019-11-06 22:33:03,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:03,754 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221735129] [2019-11-06 22:33:03,754 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:03,754 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:33:03,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763402704] [2019-11-06 22:33:03,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:33:03,755 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:33:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:03,756 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-11-06 22:33:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:04,615 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-11-06 22:33:04,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:33:04,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-06 22:33:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:04,619 INFO L225 Difference]: With dead ends: 717 [2019-11-06 22:33:04,619 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:33:04,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:33:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:33:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:33:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-11-06 22:33:04,638 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 160 [2019-11-06 22:33:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:04,638 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-11-06 22:33:04,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:33:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-11-06 22:33:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-06 22:33:04,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:04,641 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:33:04,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1806866058, now seen corresponding path program 1 times [2019-11-06 22:33:04,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:04,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158493292] [2019-11-06 22:33:04,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:04,734 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158493292] [2019-11-06 22:33:04,735 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:04,735 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:33:04,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647880018] [2019-11-06 22:33:04,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:33:04,736 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:04,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:33:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:33:04,737 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-11-06 22:33:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:05,546 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-11-06 22:33:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:33:05,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-11-06 22:33:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:05,551 INFO L225 Difference]: With dead ends: 951 [2019-11-06 22:33:05,551 INFO L226 Difference]: Without dead ends: 637 [2019-11-06 22:33:05,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:33:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-11-06 22:33:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-11-06 22:33:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:33:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-11-06 22:33:05,575 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 168 [2019-11-06 22:33:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:05,576 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-11-06 22:33:05,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:33:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-11-06 22:33:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-06 22:33:05,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:05,579 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:33:05,580 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1446244430, now seen corresponding path program 1 times [2019-11-06 22:33:05,580 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:05,581 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903312010] [2019-11-06 22:33:05,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:05,773 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903312010] [2019-11-06 22:33:05,773 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:05,773 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:33:05,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268273452] [2019-11-06 22:33:05,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:33:05,774 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:33:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:05,775 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-11-06 22:33:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:06,438 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-11-06 22:33:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:33:06,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-11-06 22:33:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:06,447 INFO L225 Difference]: With dead ends: 1330 [2019-11-06 22:33:06,447 INFO L226 Difference]: Without dead ends: 626 [2019-11-06 22:33:06,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-06 22:33:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-11-06 22:33:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:33:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-11-06 22:33:06,482 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 170 [2019-11-06 22:33:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:06,482 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-11-06 22:33:06,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:33:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-11-06 22:33:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-06 22:33:06,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:06,486 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:06,487 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1864889838, now seen corresponding path program 1 times [2019-11-06 22:33:06,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:06,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175536620] [2019-11-06 22:33:06,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:06,838 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175536620] [2019-11-06 22:33:06,838 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:06,839 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:33:06,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027129849] [2019-11-06 22:33:06,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:33:06,840 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:33:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:06,841 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-11-06 22:33:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:07,475 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-11-06 22:33:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:33:07,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-11-06 22:33:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:07,479 INFO L225 Difference]: With dead ends: 1332 [2019-11-06 22:33:07,480 INFO L226 Difference]: Without dead ends: 626 [2019-11-06 22:33:07,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:33:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-06 22:33:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-11-06 22:33:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:33:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-11-06 22:33:07,499 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 172 [2019-11-06 22:33:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:07,499 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-11-06 22:33:07,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:33:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-11-06 22:33:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-06 22:33:07,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:07,503 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:07,503 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1412924006, now seen corresponding path program 1 times [2019-11-06 22:33:07,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:07,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136036590] [2019-11-06 22:33:07,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:07,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136036590] [2019-11-06 22:33:07,573 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:33:07,573 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:33:07,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507215396] [2019-11-06 22:33:07,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:33:07,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:33:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:33:07,575 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-11-06 22:33:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:08,310 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-11-06 22:33:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:33:08,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-11-06 22:33:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:08,319 INFO L225 Difference]: With dead ends: 1858 [2019-11-06 22:33:08,320 INFO L226 Difference]: Without dead ends: 1238 [2019-11-06 22:33:08,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:33:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-06 22:33:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-11-06 22:33:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-11-06 22:33:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-11-06 22:33:08,360 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 176 [2019-11-06 22:33:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:08,361 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-11-06 22:33:08,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:33:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-11-06 22:33:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-06 22:33:08,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:08,366 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:33:08,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -788488225, now seen corresponding path program 1 times [2019-11-06 22:33:08,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:08,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838750727] [2019-11-06 22:33:08,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:08,562 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838750727] [2019-11-06 22:33:08,562 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636666696] [2019-11-06 22:33:08,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:33:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:08,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:33:08,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:33:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:33:08,771 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:33:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:33:08,842 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:33:08,842 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2019-11-06 22:33:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581403078] [2019-11-06 22:33:08,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:33:08,844 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:33:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:33:08,844 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2019-11-06 22:33:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:09,381 INFO L93 Difference]: Finished difference Result 3171 states and 4306 transitions. [2019-11-06 22:33:09,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:33:09,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-06 22:33:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:09,391 INFO L225 Difference]: With dead ends: 3171 [2019-11-06 22:33:09,392 INFO L226 Difference]: Without dead ends: 1959 [2019-11-06 22:33:09,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:33:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2019-11-06 22:33:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1959. [2019-11-06 22:33:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-11-06 22:33:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2496 transitions. [2019-11-06 22:33:09,483 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2496 transitions. Word has length 181 [2019-11-06 22:33:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:09,484 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 2496 transitions. [2019-11-06 22:33:09,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:33:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2496 transitions. [2019-11-06 22:33:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-06 22:33:09,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:09,494 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:33:09,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:33:09,699 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1479656218, now seen corresponding path program 1 times [2019-11-06 22:33:09,700 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:09,701 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352850957] [2019-11-06 22:33:09,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:09,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352850957] [2019-11-06 22:33:09,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688710328] [2019-11-06 22:33:09,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:33:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:09,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:33:09,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:33:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 22:33:10,040 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:33:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 22:33:10,160 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:33:10,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-11-06 22:33:10,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679575958] [2019-11-06 22:33:10,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:33:10,162 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:33:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:33:10,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:33:10,163 INFO L87 Difference]: Start difference. First operand 1959 states and 2496 transitions. Second operand 3 states. [2019-11-06 22:33:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:33:10,734 INFO L93 Difference]: Finished difference Result 4639 states and 5951 transitions. [2019-11-06 22:33:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:33:10,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-06 22:33:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:33:10,749 INFO L225 Difference]: With dead ends: 4639 [2019-11-06 22:33:10,749 INFO L226 Difference]: Without dead ends: 2686 [2019-11-06 22:33:10,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:33:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-11-06 22:33:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2538. [2019-11-06 22:33:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2019-11-06 22:33:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3054 transitions. [2019-11-06 22:33:10,819 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3054 transitions. Word has length 210 [2019-11-06 22:33:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:33:10,820 INFO L462 AbstractCegarLoop]: Abstraction has 2538 states and 3054 transitions. [2019-11-06 22:33:10,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:33:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3054 transitions. [2019-11-06 22:33:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-06 22:33:10,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:33:10,831 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:33:11,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:33:11,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:33:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:33:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -271216172, now seen corresponding path program 1 times [2019-11-06 22:33:11,037 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:33:11,037 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555852209] [2019-11-06 22:33:11,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:33:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:11,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555852209] [2019-11-06 22:33:11,184 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584483377] [2019-11-06 22:33:11,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:33:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:33:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-06 22:33:11,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:33:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:11,355 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:33:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:33:11,505 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [749887373] [2019-11-06 22:33:11,512 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 226 [2019-11-06 22:33:11,576 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:33:11,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)