/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/Problem11_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:45:49,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:45:49,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:45:49,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:45:49,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:45:49,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:45:49,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:45:49,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:45:49,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:45:49,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:45:49,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:45:49,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:45:49,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:45:49,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:45:49,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:45:49,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:45:49,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:45:49,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:45:49,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:45:49,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:45:49,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:45:49,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:45:49,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:45:49,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:45:49,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:45:49,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:45:49,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:45:49,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:45:49,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:45:49,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:45:49,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:45:49,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:45:49,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:45:49,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:45:49,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:45:49,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:45:49,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:45:49,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:45:49,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:45:49,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:45:49,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:45:49,465 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:45:49,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:45:49,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:45:49,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:45:49,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:45:49,496 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:45:49,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:45:49,496 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:45:49,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:45:49,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:45:49,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:45:49,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:45:49,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:45:49,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:45:49,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:45:49,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:45:49,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:45:49,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:45:49,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:45:49,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:45:49,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:45:49,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:45:49,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:45:49,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:45:49,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:45:49,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:45:49,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:45:49,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:45:49,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:45:49,504 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:45:49,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:45:49,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:45:49,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:45:49,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:45:49,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:45:49,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label15.c [2019-11-06 22:45:49,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa4a0a28/00a24647e35a42f3a90de6c8330b783f/FLAG082ad1156 [2019-11-06 22:45:50,479 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:45:50,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label15.c [2019-11-06 22:45:50,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa4a0a28/00a24647e35a42f3a90de6c8330b783f/FLAG082ad1156 [2019-11-06 22:45:50,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa4a0a28/00a24647e35a42f3a90de6c8330b783f [2019-11-06 22:45:50,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:45:50,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:45:50,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:45:50,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:45:50,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:45:50,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:50" (1/1) ... [2019-11-06 22:45:50,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8e11f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:50, skipping insertion in model container [2019-11-06 22:45:50,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:50" (1/1) ... [2019-11-06 22:45:50,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:45:50,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:45:51,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:45:51,393 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:45:51,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:45:51,749 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:45:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51 WrapperNode [2019-11-06 22:45:51,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:45:51,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:45:51,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:45:51,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:45:51,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (1/1) ... [2019-11-06 22:45:51,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:45:51,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:45:51,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:45:51,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:45:51,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (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:45:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:45:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:45:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:45:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:45:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:45:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:45:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:45:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:45:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:45:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:45:52,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:45:53,773 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:45:53,773 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:45:53,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:53 BoogieIcfgContainer [2019-11-06 22:45:53,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:45:53,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:45:53,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:45:53,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:45:53,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:50" (1/3) ... [2019-11-06 22:45:53,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b42f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:53, skipping insertion in model container [2019-11-06 22:45:53,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:51" (2/3) ... [2019-11-06 22:45:53,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b42f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:53, skipping insertion in model container [2019-11-06 22:45:53,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:53" (3/3) ... [2019-11-06 22:45:53,784 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label15.c [2019-11-06 22:45:53,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:45:53,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:45:53,839 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:45:53,881 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:45:53,882 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:45:53,882 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:45:53,882 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:45:53,882 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:45:53,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:45:53,883 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:45:53,883 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:45:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-11-06 22:45:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:45:53,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:45:53,930 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] [2019-11-06 22:45:53,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:45:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:45:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1453317925, now seen corresponding path program 1 times [2019-11-06 22:45:53,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:45:53,950 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504342089] [2019-11-06 22:45:53,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:45:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:45:54,289 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:45:54,290 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504342089] [2019-11-06 22:45:54,291 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:45:54,291 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:45:54,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617950504] [2019-11-06 22:45:54,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:45:54,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:45:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:45:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:45:54,318 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-11-06 22:45:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:45:56,341 INFO L93 Difference]: Finished difference Result 981 states and 1757 transitions. [2019-11-06 22:45:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:45:56,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-06 22:45:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:45:56,369 INFO L225 Difference]: With dead ends: 981 [2019-11-06 22:45:56,370 INFO L226 Difference]: Without dead ends: 622 [2019-11-06 22:45:56,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:45:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-06 22:45:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-06 22:45:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-06 22:45:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 880 transitions. [2019-11-06 22:45:56,468 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 880 transitions. Word has length 20 [2019-11-06 22:45:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:45:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 880 transitions. [2019-11-06 22:45:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:45:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 880 transitions. [2019-11-06 22:45:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-06 22:45:56,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:45:56,488 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:45:56,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:45:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:45:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1546422986, now seen corresponding path program 1 times [2019-11-06 22:45:56,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:45:56,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228691036] [2019-11-06 22:45:56,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:45:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:45:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:45:56,713 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228691036] [2019-11-06 22:45:56,713 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:45:56,713 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:45:56,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466324103] [2019-11-06 22:45:56,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:45:56,715 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:45:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:45:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:45:56,716 INFO L87 Difference]: Start difference. First operand 622 states and 880 transitions. Second operand 6 states. [2019-11-06 22:45:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:45:58,622 INFO L93 Difference]: Finished difference Result 1837 states and 2643 transitions. [2019-11-06 22:45:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:45:58,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-06 22:45:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:45:58,631 INFO L225 Difference]: With dead ends: 1837 [2019-11-06 22:45:58,632 INFO L226 Difference]: Without dead ends: 1221 [2019-11-06 22:45:58,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:45:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-11-06 22:45:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1210. [2019-11-06 22:45:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-06 22:45:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1600 transitions. [2019-11-06 22:45:58,702 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1600 transitions. Word has length 100 [2019-11-06 22:45:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:45:58,704 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1600 transitions. [2019-11-06 22:45:58,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:45:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1600 transitions. [2019-11-06 22:45:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 22:45:58,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:45:58,709 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:45:58,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:45:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:45:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1386273764, now seen corresponding path program 1 times [2019-11-06 22:45:58,710 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:45:58,711 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179208778] [2019-11-06 22:45:58,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:45:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:45:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:45:58,952 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179208778] [2019-11-06 22:45:58,952 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:45:58,952 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:45:58,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963063495] [2019-11-06 22:45:58,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:45:58,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:45:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:45:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:45:58,954 INFO L87 Difference]: Start difference. First operand 1210 states and 1600 transitions. Second operand 4 states. [2019-11-06 22:46:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:46:00,898 INFO L93 Difference]: Finished difference Result 4723 states and 6446 transitions. [2019-11-06 22:46:00,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:46:00,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-06 22:46:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:46:00,925 INFO L225 Difference]: With dead ends: 4723 [2019-11-06 22:46:00,926 INFO L226 Difference]: Without dead ends: 3519 [2019-11-06 22:46:00,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:46:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2019-11-06 22:46:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3118. [2019-11-06 22:46:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-11-06 22:46:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4067 transitions. [2019-11-06 22:46:01,064 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4067 transitions. Word has length 151 [2019-11-06 22:46:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:46:01,073 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 4067 transitions. [2019-11-06 22:46:01,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:46:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4067 transitions. [2019-11-06 22:46:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-06 22:46:01,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:46:01,086 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:46:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:46:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 782773517, now seen corresponding path program 1 times [2019-11-06 22:46:01,087 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:46:01,087 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404139724] [2019-11-06 22:46:01,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:46:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:46:01,303 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404139724] [2019-11-06 22:46:01,303 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098549774] [2019-11-06 22:46:01,303 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:46:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:01,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 22:46:01,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:46:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 22:46:01,621 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:46:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:46:01,761 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:46:01,762 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-11-06 22:46:01,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020544166] [2019-11-06 22:46:01,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:46:01,765 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:46:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:46:01,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:46:01,766 INFO L87 Difference]: Start difference. First operand 3118 states and 4067 transitions. Second operand 5 states. [2019-11-06 22:46:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:46:03,465 INFO L93 Difference]: Finished difference Result 7090 states and 9733 transitions. [2019-11-06 22:46:03,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:46:03,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-11-06 22:46:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:46:03,494 INFO L225 Difference]: With dead ends: 7090 [2019-11-06 22:46:03,495 INFO L226 Difference]: Without dead ends: 4166 [2019-11-06 22:46:03,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:46:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-06 22:46:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 3552. [2019-11-06 22:46:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-11-06 22:46:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4682 transitions. [2019-11-06 22:46:03,634 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 4682 transitions. Word has length 186 [2019-11-06 22:46:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:46:03,635 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 4682 transitions. [2019-11-06 22:46:03,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:46:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 4682 transitions. [2019-11-06 22:46:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-06 22:46:03,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:46:03,639 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:46:03,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:46:03,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:46:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:46:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2027682720, now seen corresponding path program 1 times [2019-11-06 22:46:03,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:46:03,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115504920] [2019-11-06 22:46:03,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:46:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-06 22:46:04,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115504920] [2019-11-06 22:46:04,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492736830] [2019-11-06 22:46:04,243 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:46:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:04,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:46:04,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:46:04,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 22:46:04,475 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:46:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:04,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:46:04,844 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:46:04,844 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 5] total 14 [2019-11-06 22:46:04,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949653570] [2019-11-06 22:46:04,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:46:04,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:46:04,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:46:04,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:46:04,845 INFO L87 Difference]: Start difference. First operand 3552 states and 4682 transitions. Second operand 5 states. [2019-11-06 22:46:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:46:06,532 INFO L93 Difference]: Finished difference Result 7353 states and 9767 transitions. [2019-11-06 22:46:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:46:06,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-11-06 22:46:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:46:06,553 INFO L225 Difference]: With dead ends: 7353 [2019-11-06 22:46:06,554 INFO L226 Difference]: Without dead ends: 3807 [2019-11-06 22:46:06,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:46:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-11-06 22:46:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3786. [2019-11-06 22:46:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-11-06 22:46:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5003 transitions. [2019-11-06 22:46:06,665 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5003 transitions. Word has length 187 [2019-11-06 22:46:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:46:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 3786 states and 5003 transitions. [2019-11-06 22:46:06,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:46:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5003 transitions. [2019-11-06 22:46:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-06 22:46:06,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:46:06,670 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:06,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:46:06,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:46:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:46:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1231270553, now seen corresponding path program 1 times [2019-11-06 22:46:06,876 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:46:06,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449165385] [2019-11-06 22:46:06,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:46:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 108 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:46:07,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449165385] [2019-11-06 22:46:07,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16205370] [2019-11-06 22:46:07,097 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:46:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:46:07,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 22:46:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:46:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:07,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,791 WARN L191 SmtUtils]: Spent 10.44 s on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-11-06 22:46:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,186 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-11-06 22:46:20,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:46:20,420 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:46:20,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:46:20,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,691 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-11-06 22:46:20,907 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-11-06 22:46:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:20,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,306 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 37 [2019-11-06 22:46:21,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:46:21,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:46:21,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13