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-13a467a-m [2019-10-14 23:55:34,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:55:34,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:55:34,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:55:34,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:55:34,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:55:34,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:55:34,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:55:34,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:55:34,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:55:34,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:55:34,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:55:34,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:55:34,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:55:34,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:55:34,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:55:34,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:55:34,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:55:34,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:55:34,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:55:34,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:55:34,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:55:34,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:55:34,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:55:34,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:55:34,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:55:34,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:55:34,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:55:34,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:55:34,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:55:34,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:55:34,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:55:34,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:55:34,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:55:34,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:55:34,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:55:34,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:55:34,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:55:34,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:55:34,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:55:34,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:55:34,210 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-10-14 23:55:34,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:55:34,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:55:34,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:55:34,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:55:34,234 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:55:34,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:55:34,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:55:34,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:55:34,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:55:34,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:55:34,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:55:34,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:55:34,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:55:34,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:55:34,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:55:34,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:55:34,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:55:34,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:55:34,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:55:34,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:55:34,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:55:34,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:55:34,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:55:34,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:55:34,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:55:34,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:55:34,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:55:34,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:55:34,240 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-10-14 23:55:34,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:55:34,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:55:34,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:55:34,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:55:34,536 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:55:34,536 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-10-14 23:55:34,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9864b9/c45cdeccd48a437884e36a0a26d22f9c/FLAGb5544a91e [2019-10-14 23:55:35,161 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:55:35,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06.c [2019-10-14 23:55:35,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9864b9/c45cdeccd48a437884e36a0a26d22f9c/FLAGb5544a91e [2019-10-14 23:55:35,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9864b9/c45cdeccd48a437884e36a0a26d22f9c [2019-10-14 23:55:35,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:55:35,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:55:35,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:55:35,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:55:35,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:55:35,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:35" (1/1) ... [2019-10-14 23:55:35,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709a20b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:35, skipping insertion in model container [2019-10-14 23:55:35,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:35" (1/1) ... [2019-10-14 23:55:35,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:55:35,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:55:36,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:55:36,154 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:55:36,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:55:36,250 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:55:36,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36 WrapperNode [2019-10-14 23:55:36,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:55:36,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:55:36,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:55:36,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:55:36,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... [2019-10-14 23:55:36,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:55:36,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:55:36,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:55:36,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:55:36,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:55:36,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:55:36,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:55:36,427 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:55:36,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:55:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:55:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:55:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:55:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:55:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:55:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:55:36,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:55:37,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:55:37,627 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:55:37,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:37 BoogieIcfgContainer [2019-10-14 23:55:37,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:55:37,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:55:37,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:55:37,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:55:37,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:55:35" (1/3) ... [2019-10-14 23:55:37,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a103bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:37, skipping insertion in model container [2019-10-14 23:55:37,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:36" (2/3) ... [2019-10-14 23:55:37,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a103bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:37, skipping insertion in model container [2019-10-14 23:55:37,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:37" (3/3) ... [2019-10-14 23:55:37,637 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-10-14 23:55:37,647 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:55:37,658 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:55:37,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:55:37,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:55:37,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:55:37,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:55:37,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:55:37,699 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:55:37,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:55:37,700 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:55:37,700 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:55:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:55:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-14 23:55:37,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:37,755 INFO L380 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-10-14 23:55:37,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1121979298, now seen corresponding path program 1 times [2019-10-14 23:55:37,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:37,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874441101] [2019-10-14 23:55:37,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:37,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:37,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:38,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874441101] [2019-10-14 23:55:38,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:38,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:55:38,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926989371] [2019-10-14 23:55:38,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:55:38,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:55:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:55:38,392 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:55:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:39,252 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:55:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:55:39,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-14 23:55:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:39,277 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:55:39,278 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:55:39,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:55:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:55:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:55:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:55:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:55:39,358 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 146 [2019-10-14 23:55:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:39,359 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:55:39,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:55:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:55:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:55:39,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:39,365 INFO L380 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-10-14 23:55:39,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash -74166087, now seen corresponding path program 1 times [2019-10-14 23:55:39,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:39,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228402271] [2019-10-14 23:55:39,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:39,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:39,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:39,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228402271] [2019-10-14 23:55:39,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:39,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:55:39,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038347535] [2019-10-14 23:55:39,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:55:39,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:55:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:55:39,706 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:55:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:40,411 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:55:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:55:40,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-14 23:55:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:40,418 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:55:40,418 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:55:40,420 INFO L600 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-10-14 23:55:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:55:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:55:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:55:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:55:40,443 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 154 [2019-10-14 23:55:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:40,444 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:55:40,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:55:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:55:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-14 23:55:40,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:40,447 INFO L380 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-10-14 23:55:40,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash 742954861, now seen corresponding path program 1 times [2019-10-14 23:55:40,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:40,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585065360] [2019-10-14 23:55:40,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:40,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:40,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:40,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585065360] [2019-10-14 23:55:40,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:40,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:55:40,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199898969] [2019-10-14 23:55:40,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:55:40,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:55:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:55:40,774 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:55:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:41,465 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:55:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:55:41,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-14 23:55:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:41,470 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:55:41,470 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:55:41,472 INFO L600 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-10-14 23:55:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:55:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:55:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:55:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:55:41,487 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 160 [2019-10-14 23:55:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:41,487 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:55:41,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:55:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:55:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-14 23:55:41,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:41,491 INFO L380 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-10-14 23:55:41,491 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1806866058, now seen corresponding path program 1 times [2019-10-14 23:55:41,492 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:41,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306003520] [2019-10-14 23:55:41,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:41,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:41,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:41,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306003520] [2019-10-14 23:55:41,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:41,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:55:41,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042010833] [2019-10-14 23:55:41,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:55:41,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:55:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:55:41,578 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:55:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:42,350 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:55:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:55:42,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-14 23:55:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:42,356 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:55:42,356 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:55:42,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:55:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:55:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:55:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:55:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-14 23:55:42,385 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 168 [2019-10-14 23:55:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:42,386 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-14 23:55:42,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:55:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-14 23:55:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-14 23:55:42,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:42,390 INFO L380 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-10-14 23:55:42,390 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1446244430, now seen corresponding path program 1 times [2019-10-14 23:55:42,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:42,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603283362] [2019-10-14 23:55:42,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:42,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:42,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:42,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603283362] [2019-10-14 23:55:42,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:42,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:55:42,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947511450] [2019-10-14 23:55:42,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:55:42,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:55:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:55:42,602 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-14 23:55:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:43,321 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-14 23:55:43,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:55:43,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-14 23:55:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:43,325 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:55:43,325 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:55:43,327 INFO L600 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-10-14 23:55:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:55:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:55:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:55:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-14 23:55:43,348 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 170 [2019-10-14 23:55:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:43,349 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-14 23:55:43,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:55:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-14 23:55:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-14 23:55:43,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:43,352 INFO L380 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-10-14 23:55:43,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1864889838, now seen corresponding path program 1 times [2019-10-14 23:55:43,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:43,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104286168] [2019-10-14 23:55:43,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:43,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:43,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104286168] [2019-10-14 23:55:43,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:43,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:55:43,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682097599] [2019-10-14 23:55:43,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:55:43,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:55:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:55:43,553 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-14 23:55:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:44,151 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-14 23:55:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:55:44,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-14 23:55:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:44,157 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:55:44,157 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:55:44,159 INFO L600 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-10-14 23:55:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:55:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:55:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:55:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-14 23:55:44,178 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 172 [2019-10-14 23:55:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:44,179 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-14 23:55:44,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:55:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-14 23:55:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-14 23:55:44,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:44,182 INFO L380 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-10-14 23:55:44,183 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1412924006, now seen corresponding path program 1 times [2019-10-14 23:55:44,183 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:44,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654364752] [2019-10-14 23:55:44,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:44,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:44,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:44,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654364752] [2019-10-14 23:55:44,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:55:44,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:55:44,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129848077] [2019-10-14 23:55:44,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:55:44,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:55:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:55:44,273 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-14 23:55:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:45,031 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-14 23:55:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:55:45,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-14 23:55:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:45,041 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:55:45,041 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:55:45,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:55:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:55:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:55:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:55:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-14 23:55:45,083 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 176 [2019-10-14 23:55:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-14 23:55:45,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:55:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-14 23:55:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-14 23:55:45,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:45,089 INFO L380 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-10-14 23:55:45,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash -788488225, now seen corresponding path program 1 times [2019-10-14 23:55:45,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:45,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677257191] [2019-10-14 23:55:45,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:45,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:45,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:45,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677257191] [2019-10-14 23:55:45,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435310143] [2019-10-14 23:55:45,233 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-10-14 23:55:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:45,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:55:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:55:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:55:45,483 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:55:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:55:45,612 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:55:45,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2019-10-14 23:55:45,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496302900] [2019-10-14 23:55:45,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:55:45,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:55:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:55:45,615 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2019-10-14 23:55:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:46,255 INFO L93 Difference]: Finished difference Result 3171 states and 4306 transitions. [2019-10-14 23:55:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:55:46,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-14 23:55:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:46,266 INFO L225 Difference]: With dead ends: 3171 [2019-10-14 23:55:46,267 INFO L226 Difference]: Without dead ends: 1959 [2019-10-14 23:55:46,271 INFO L600 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-10-14 23:55:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2019-10-14 23:55:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1959. [2019-10-14 23:55:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-10-14 23:55:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2496 transitions. [2019-10-14 23:55:46,330 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2496 transitions. Word has length 181 [2019-10-14 23:55:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:46,331 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 2496 transitions. [2019-10-14 23:55:46,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:55:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2496 transitions. [2019-10-14 23:55:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-14 23:55:46,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:46,339 INFO L380 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-10-14 23:55:46,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:55:46,546 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1479656218, now seen corresponding path program 1 times [2019-10-14 23:55:46,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:46,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732039518] [2019-10-14 23:55:46,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:46,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:46,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732039518] [2019-10-14 23:55:46,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968052398] [2019-10-14 23:55:46,671 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-10-14 23:55:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:46,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:55:46,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:55:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:55:46,876 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:55:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:55:47,019 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:55:47,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:55:47,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110506833] [2019-10-14 23:55:47,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:55:47,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:55:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:55:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:55:47,021 INFO L87 Difference]: Start difference. First operand 1959 states and 2496 transitions. Second operand 3 states. [2019-10-14 23:55:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:55:47,521 INFO L93 Difference]: Finished difference Result 4639 states and 5951 transitions. [2019-10-14 23:55:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:55:47,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-14 23:55:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:55:47,539 INFO L225 Difference]: With dead ends: 4639 [2019-10-14 23:55:47,539 INFO L226 Difference]: Without dead ends: 2686 [2019-10-14 23:55:47,545 INFO L600 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-10-14 23:55:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-10-14 23:55:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2538. [2019-10-14 23:55:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2019-10-14 23:55:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3054 transitions. [2019-10-14 23:55:47,613 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3054 transitions. Word has length 210 [2019-10-14 23:55:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:55:47,615 INFO L462 AbstractCegarLoop]: Abstraction has 2538 states and 3054 transitions. [2019-10-14 23:55:47,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:55:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3054 transitions. [2019-10-14 23:55:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-14 23:55:47,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:55:47,625 INFO L380 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-10-14 23:55:47,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:55:47,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:55:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:55:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash -271216172, now seen corresponding path program 1 times [2019-10-14 23:55:47,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:55:47,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683728590] [2019-10-14 23:55:47,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:47,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:55:47,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:55:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:47,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683728590] [2019-10-14 23:55:47,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125728701] [2019-10-14 23:55:47,953 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-10-14 23:55:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:55:48,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:55:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:55:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:48,120 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:55:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:55:48,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1387588844] [2019-10-14 23:55:48,222 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 226 [2019-10-14 23:55:48,286 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:55:48,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)