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/Problem14_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:05:25,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:05:25,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:05:25,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:05:25,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:05:25,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:05:25,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:05:25,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:05:25,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:05:25,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:05:25,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:05:25,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:05:25,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:05:25,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:05:25,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:05:25,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:05:25,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:05:25,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:05:25,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:05:25,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:05:25,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:05:25,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:05:25,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:05:25,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:05:25,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:05:25,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:05:25,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:05:25,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:05:25,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:05:25,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:05:25,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:05:25,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:05:25,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:05:25,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:05:25,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:05:25,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:05:25,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:05:25,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:05:25,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:05:25,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:05:25,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:05:25,368 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-15 00:05:25,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:05:25,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:05:25,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:05:25,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:05:25,391 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:05:25,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:05:25,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:05:25,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:05:25,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:05:25,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:05:25,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:05:25,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:05:25,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:05:25,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:05:25,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:05:25,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:05:25,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:05:25,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:05:25,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:05:25,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:05:25,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:05:25,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:05:25,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:05:25,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:05:25,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:05:25,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:05:25,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:05:25,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:05:25,397 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-15 00:05:25,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:05:25,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:05:25,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:05:25,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:05:25,710 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:05:25,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label08.c [2019-10-15 00:05:25,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf4a9068/4d26353d70464097b758b660859a70e9/FLAGb94dd4299 [2019-10-15 00:05:26,416 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:05:26,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label08.c [2019-10-15 00:05:26,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf4a9068/4d26353d70464097b758b660859a70e9/FLAGb94dd4299 [2019-10-15 00:05:26,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf4a9068/4d26353d70464097b758b660859a70e9 [2019-10-15 00:05:26,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:05:26,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:05:26,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:05:26,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:05:26,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:05:26,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:05:26" (1/1) ... [2019-10-15 00:05:26,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100f17a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:26, skipping insertion in model container [2019-10-15 00:05:26,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:05:26" (1/1) ... [2019-10-15 00:05:26,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:05:26,741 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:05:27,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:05:27,388 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:05:27,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:05:27,585 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:05:27,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27 WrapperNode [2019-10-15 00:05:27,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:05:27,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:05:27,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:05:27,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:05:27,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (1/1) ... [2019-10-15 00:05:27,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:05:27,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:05:27,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:05:27,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:05:27,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (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-15 00:05:27,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:05:27,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:05:27,824 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:05:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:05:29,186 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:05:29,186 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:05:29,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:05:29 BoogieIcfgContainer [2019-10-15 00:05:29,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:05:29,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:05:29,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:05:29,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:05:29,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:05:26" (1/3) ... [2019-10-15 00:05:29,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f14d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:05:29, skipping insertion in model container [2019-10-15 00:05:29,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:05:27" (2/3) ... [2019-10-15 00:05:29,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f14d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:05:29, skipping insertion in model container [2019-10-15 00:05:29,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:05:29" (3/3) ... [2019-10-15 00:05:29,197 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label08.c [2019-10-15 00:05:29,208 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:05:29,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:05:29,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:05:29,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:05:29,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:05:29,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:05:29,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:05:29,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:05:29,258 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:05:29,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:05:29,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:05:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-15 00:05:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 00:05:29,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:29,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:05:29,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash -597113733, now seen corresponding path program 1 times [2019-10-15 00:05:29,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:29,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26962578] [2019-10-15 00:05:29,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:29,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:29,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:29,567 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-15 00:05:29,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26962578] [2019-10-15 00:05:29,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:29,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:05:29,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787949891] [2019-10-15 00:05:29,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:05:29,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:05:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:05:29,597 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-15 00:05:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:30,870 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-10-15 00:05:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:05:30,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 00:05:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:30,889 INFO L225 Difference]: With dead ends: 688 [2019-10-15 00:05:30,889 INFO L226 Difference]: Without dead ends: 372 [2019-10-15 00:05:30,898 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-15 00:05:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-15 00:05:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-15 00:05:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-15 00:05:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-15 00:05:30,984 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 18 [2019-10-15 00:05:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:30,985 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-15 00:05:30,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:05:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-15 00:05:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 00:05:30,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:30,990 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] [2019-10-15 00:05:30,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -866058331, now seen corresponding path program 1 times [2019-10-15 00:05:30,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:30,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010010365] [2019-10-15 00:05:30,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:30,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:30,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:31,292 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-15 00:05:31,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010010365] [2019-10-15 00:05:31,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:31,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:05:31,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798936956] [2019-10-15 00:05:31,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:05:31,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:05:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:05:31,298 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-15 00:05:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:32,729 INFO L93 Difference]: Finished difference Result 1122 states and 1837 transitions. [2019-10-15 00:05:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:05:32,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-15 00:05:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:32,737 INFO L225 Difference]: With dead ends: 1122 [2019-10-15 00:05:32,737 INFO L226 Difference]: Without dead ends: 756 [2019-10-15 00:05:32,740 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-15 00:05:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-10-15 00:05:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2019-10-15 00:05:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-15 00:05:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2019-10-15 00:05:32,819 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 87 [2019-10-15 00:05:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:32,820 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2019-10-15 00:05:32,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:05:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2019-10-15 00:05:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 00:05:32,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:32,826 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] [2019-10-15 00:05:32,826 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1300336130, now seen corresponding path program 1 times [2019-10-15 00:05:32,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:32,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833479290] [2019-10-15 00:05:32,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:32,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:32,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:33,008 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-15 00:05:33,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833479290] [2019-10-15 00:05:33,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:33,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:05:33,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468457662] [2019-10-15 00:05:33,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:05:33,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:33,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:05:33,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:05:33,011 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2019-10-15 00:05:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:34,331 INFO L93 Difference]: Finished difference Result 1904 states and 3099 transitions. [2019-10-15 00:05:34,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:05:34,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-15 00:05:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:34,341 INFO L225 Difference]: With dead ends: 1904 [2019-10-15 00:05:34,341 INFO L226 Difference]: Without dead ends: 1158 [2019-10-15 00:05:34,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 00:05:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-15 00:05:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2019-10-15 00:05:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-10-15 00:05:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2019-10-15 00:05:34,405 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 88 [2019-10-15 00:05:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:34,408 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2019-10-15 00:05:34,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:05:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2019-10-15 00:05:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 00:05:34,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:34,416 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] [2019-10-15 00:05:34,417 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1278217766, now seen corresponding path program 1 times [2019-10-15 00:05:34,418 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:34,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639684954] [2019-10-15 00:05:34,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:34,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:34,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:34,532 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-15 00:05:34,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639684954] [2019-10-15 00:05:34,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:34,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:05:34,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751935238] [2019-10-15 00:05:34,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:05:34,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:05:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:05:34,535 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2019-10-15 00:05:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:35,813 INFO L93 Difference]: Finished difference Result 2880 states and 4162 transitions. [2019-10-15 00:05:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:05:35,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 00:05:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:35,832 INFO L225 Difference]: With dead ends: 2880 [2019-10-15 00:05:35,832 INFO L226 Difference]: Without dead ends: 1748 [2019-10-15 00:05:35,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 00:05:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-10-15 00:05:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2019-10-15 00:05:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-10-15 00:05:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2019-10-15 00:05:35,897 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 90 [2019-10-15 00:05:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:35,898 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2019-10-15 00:05:35,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:05:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2019-10-15 00:05:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-15 00:05:35,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:35,901 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:05:35,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1132692271, now seen corresponding path program 1 times [2019-10-15 00:05:35,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:35,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759929055] [2019-10-15 00:05:35,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:35,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:35,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-15 00:05:36,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759929055] [2019-10-15 00:05:36,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:36,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:05:36,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378775887] [2019-10-15 00:05:36,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:05:36,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:36,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:05:36,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:05:36,080 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 4 states. [2019-10-15 00:05:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:37,424 INFO L93 Difference]: Finished difference Result 4128 states and 5824 transitions. [2019-10-15 00:05:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:05:37,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-15 00:05:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:37,449 INFO L225 Difference]: With dead ends: 4128 [2019-10-15 00:05:37,449 INFO L226 Difference]: Without dead ends: 2808 [2019-10-15 00:05:37,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:05:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-10-15 00:05:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1712. [2019-10-15 00:05:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-10-15 00:05:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2319 transitions. [2019-10-15 00:05:37,513 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2319 transitions. Word has length 174 [2019-10-15 00:05:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:37,514 INFO L462 AbstractCegarLoop]: Abstraction has 1712 states and 2319 transitions. [2019-10-15 00:05:37,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:05:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2319 transitions. [2019-10-15 00:05:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-15 00:05:37,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:37,519 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:05:37,519 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1658054871, now seen corresponding path program 1 times [2019-10-15 00:05:37,520 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:37,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950593015] [2019-10-15 00:05:37,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:37,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:37,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-15 00:05:37,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950593015] [2019-10-15 00:05:37,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:05:37,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:05:37,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578752331] [2019-10-15 00:05:37,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:05:37,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:05:37,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:05:37,681 INFO L87 Difference]: Start difference. First operand 1712 states and 2319 transitions. Second operand 3 states. [2019-10-15 00:05:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:38,602 INFO L93 Difference]: Finished difference Result 4350 states and 6015 transitions. [2019-10-15 00:05:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:05:38,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-15 00:05:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:38,623 INFO L225 Difference]: With dead ends: 4350 [2019-10-15 00:05:38,623 INFO L226 Difference]: Without dead ends: 2644 [2019-10-15 00:05:38,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:05:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2019-10-15 00:05:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2456. [2019-10-15 00:05:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2019-10-15 00:05:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3243 transitions. [2019-10-15 00:05:38,755 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3243 transitions. Word has length 234 [2019-10-15 00:05:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:38,756 INFO L462 AbstractCegarLoop]: Abstraction has 2456 states and 3243 transitions. [2019-10-15 00:05:38,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:05:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3243 transitions. [2019-10-15 00:05:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-15 00:05:38,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:38,773 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 00:05:38,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash -121492162, now seen corresponding path program 1 times [2019-10-15 00:05:38,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:38,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178134993] [2019-10-15 00:05:38,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:38,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:38,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:05:40,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178134993] [2019-10-15 00:05:40,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761062319] [2019-10-15 00:05:40,104 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-15 00:05:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:40,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:05:40,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:05:40,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 00:05:40,473 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:05:40,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:05:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 22 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 00:05:41,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:05:41,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-10-15 00:05:41,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60616708] [2019-10-15 00:05:41,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:05:41,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:05:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:05:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-10-15 00:05:41,134 INFO L87 Difference]: Start difference. First operand 2456 states and 3243 transitions. Second operand 5 states. [2019-10-15 00:05:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:05:42,671 INFO L93 Difference]: Finished difference Result 4928 states and 6538 transitions. [2019-10-15 00:05:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:05:42,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-10-15 00:05:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:05:42,689 INFO L225 Difference]: With dead ends: 4928 [2019-10-15 00:05:42,689 INFO L226 Difference]: Without dead ends: 2478 [2019-10-15 00:05:42,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 513 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-10-15 00:05:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-15 00:05:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2462. [2019-10-15 00:05:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-10-15 00:05:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 3228 transitions. [2019-10-15 00:05:42,786 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 3228 transitions. Word has length 259 [2019-10-15 00:05:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:05:42,787 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 3228 transitions. [2019-10-15 00:05:42,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:05:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 3228 transitions. [2019-10-15 00:05:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-15 00:05:42,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:05:42,799 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-10-15 00:05:43,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:05:43,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:05:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:05:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1137249175, now seen corresponding path program 1 times [2019-10-15 00:05:43,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:05:43,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136299485] [2019-10-15 00:05:43,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:43,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:05:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:05:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 119 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 00:05:44,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136299485] [2019-10-15 00:05:44,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609920035] [2019-10-15 00:05:44,018 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-15 00:05:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:05:44,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-15 00:05:44,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:05:44,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:05:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 248 proven. 53 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 00:05:44,469 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:05:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 00:05:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 41 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 00:05:44,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [658167783] [2019-10-15 00:05:44,964 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 344 [2019-10-15 00:05:45,029 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:05:45,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:06:01,791 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:06:01,793 INFO L272 AbstractInterpreter]: Visited 138 different actions 271 times. Merged at 4 different actions 5 times. Never widened. Performed 536 root evaluator evaluations with a maximum evaluation depth of 13. Performed 536 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-15 00:06:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:06:01,798 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates