java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/nla-digbench/bresenham.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:18:20,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:18:20,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:18:20,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:18:20,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:18:20,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:18:20,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:18:20,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:18:20,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:18:20,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:18:20,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:18:20,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:18:20,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:18:20,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:18:20,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:18:20,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:18:20,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:18:20,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:18:20,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:18:20,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:18:20,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:18:20,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:18:20,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:18:20,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:18:20,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:18:20,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:18:20,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:18:20,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:18:20,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:18:20,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:18:20,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:18:20,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:18:20,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:18:20,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:18:20,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:18:20,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:18:20,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:18:20,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:18:20,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:18:20,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:18:20,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:18:20,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:18:20,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:18:20,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:18:20,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:18:20,518 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:18:20,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:18:20,520 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:18:20,520 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:18:20,520 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:18:20,520 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:18:20,520 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:18:20,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:18:20,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:18:20,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:18:20,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:18:20,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:18:20,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:18:20,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:18:20,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:18:20,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:18:20,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:18:20,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:18:20,524 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:18:20,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:18:20,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:18:20,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:18:20,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:18:20,526 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:18:20,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:18:20,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:18:20,526 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:18:20,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:18:20,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:18:20,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:18:20,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:18:20,586 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:18:20,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/bresenham.c [2019-09-10 02:18:20,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3124d0af3/164cc3a3ba9a4b1387e5642c39eb3639/FLAG8e2cac1a5 [2019-09-10 02:18:21,076 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:18:21,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham.c [2019-09-10 02:18:21,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3124d0af3/164cc3a3ba9a4b1387e5642c39eb3639/FLAG8e2cac1a5 [2019-09-10 02:18:21,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3124d0af3/164cc3a3ba9a4b1387e5642c39eb3639 [2019-09-10 02:18:21,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:18:21,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:18:21,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:18:21,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:18:21,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:18:21,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca4fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21, skipping insertion in model container [2019-09-10 02:18:21,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:18:21,536 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:18:21,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:18:21,708 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:18:21,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:18:21,756 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:18:21,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21 WrapperNode [2019-09-10 02:18:21,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:18:21,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:18:21,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:18:21,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:18:21,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... [2019-09-10 02:18:21,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:18:21,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:18:21,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:18:21,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:18:21,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:18:21,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:18:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:18:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:18:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:18:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:18:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:18:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:18:21,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:18:21,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:18:21,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:18:21,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:18:22,124 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:18:22,125 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:18:22,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:18:22 BoogieIcfgContainer [2019-09-10 02:18:22,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:18:22,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:18:22,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:18:22,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:18:22,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:18:21" (1/3) ... [2019-09-10 02:18:22,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1ee7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:18:22, skipping insertion in model container [2019-09-10 02:18:22,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:18:21" (2/3) ... [2019-09-10 02:18:22,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1ee7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:18:22, skipping insertion in model container [2019-09-10 02:18:22,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:18:22" (3/3) ... [2019-09-10 02:18:22,134 INFO L109 eAbstractionObserver]: Analyzing ICFG bresenham.c [2019-09-10 02:18:22,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:18:22,152 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:18:22,169 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:18:22,198 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:18:22,198 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:18:22,199 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:18:22,199 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:18:22,199 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:18:22,199 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:18:22,199 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:18:22,199 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:18:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-10 02:18:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:18:22,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:22,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:22,226 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1560104174, now seen corresponding path program 1 times [2019-09-10 02:18:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:22,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:18:22,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:18:22,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:18:22,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:18:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:18:22,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:18:22,354 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-10 02:18:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:22,368 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-10 02:18:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:18:22,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:18:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:22,379 INFO L225 Difference]: With dead ends: 22 [2019-09-10 02:18:22,380 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 02:18:22,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:18:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 02:18:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 02:18:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 02:18:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-10 02:18:22,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-09-10 02:18:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:22,423 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-10 02:18:22,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:18:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-10 02:18:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:18:22,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:22,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:22,424 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1561891634, now seen corresponding path program 1 times [2019-09-10 02:18:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:22,434 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:22,434 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:22,434 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-09-10 02:18:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:22,487 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 02:18:22,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:22,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:22,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:22,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:18:22,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:22,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:22,752 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:18:22,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-10 02:18:22,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:18:22,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:18:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:18:22,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:18:22,755 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-09-10 02:18:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:22,854 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 02:18:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:18:22,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-10 02:18:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:22,857 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:18:22,857 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:18:22,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:18:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:18:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-10 02:18:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:18:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-10 02:18:22,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2019-09-10 02:18:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:22,869 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-10 02:18:22,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:18:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-10 02:18:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:18:22,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:22,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:22,872 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1038075816, now seen corresponding path program 1 times [2019-09-10 02:18:22,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:22,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:22,892 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:22,894 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:22,894 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-09-10 02:18:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:22,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:22,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 02:18:22,929 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [22], [26], [33], [36], [38], [41], [43], [44], [45], [46], [48], [49] [2019-09-10 02:18:22,961 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:18:22,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:18:23,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:18:23,084 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 11. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Never found a fixpoint. Largest state had 8 variables. [2019-09-10 02:18:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:23,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:18:23,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:23,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:23,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:23,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:18:23,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:23,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:23,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:18:23,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-10 02:18:23,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:23,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:18:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:18:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:18:23,525 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 13 states. [2019-09-10 02:18:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:23,712 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-10 02:18:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:18:23,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-10 02:18:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:23,715 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:18:23,715 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:18:23,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:18:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:18:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-10 02:18:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:18:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 02:18:23,727 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2019-09-10 02:18:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:23,727 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 02:18:23,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:18:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 02:18:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 02:18:23,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:23,729 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:23,730 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 190103611, now seen corresponding path program 1 times [2019-09-10 02:18:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:23,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:23,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:23,736 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:23,736 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:23,737 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:18:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:23,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:23,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2019-09-10 02:18:23,763 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [24], [26], [33], [36], [38], [41], [43], [44], [45], [46], [48], [49], [50] [2019-09-10 02:18:23,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:18:23,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:18:23,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:18:23,807 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 11. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Never found a fixpoint. Largest state had 9 variables. [2019-09-10 02:18:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:23,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:18:23,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:23,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:23,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:23,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:18:23,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:18:24,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:24,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:24,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:18:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:18:24,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-10 02:18:24,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:24,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:18:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:18:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:18:24,270 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 18 states. [2019-09-10 02:18:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:25,234 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-09-10 02:18:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:18:25,234 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-09-10 02:18:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:25,236 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:18:25,236 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:18:25,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:18:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:18:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-09-10 02:18:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:18:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-10 02:18:25,244 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 25 [2019-09-10 02:18:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:25,244 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-10 02:18:25,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:18:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-10 02:18:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:18:25,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:25,246 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:25,246 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1626686467, now seen corresponding path program 1 times [2019-09-10 02:18:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:25,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:25,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:25,252 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:25,252 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:25,252 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:18:25,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:25,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:25,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-10 02:18:25,283 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [22], [26], [33], [36], [38], [41], [43], [44], [45], [46], [48], [49], [50] [2019-09-10 02:18:25,286 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:18:25,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:18:25,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:18:25,319 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 11. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Never found a fixpoint. Largest state had 8 variables. [2019-09-10 02:18:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:25,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:18:25,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:25,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:25,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:25,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:18:25,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:25,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 02:18:25,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:25,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:38,066 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse17 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse8 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or (forall ((v_main_~v~0_BEFORE_CALL_11 Int) (v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~X~0_BEFORE_CALL_11 Int) (v_main_~Y~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_14 Int)) (let ((.cse6 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse4 (- v_main_~X~0_BEFORE_CALL_11)) (.cse5 (* .cse6 v_main_~x~0_BEFORE_CALL_11)) (.cse7 (- v_main_~v~0_BEFORE_CALL_11))) (or (exists ((main_~v~0 Int) (main_~x~0 Int)) (let ((.cse0 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse3 (- main_~v~0)) (.cse1 (- v_main_~X~0_BEFORE_CALL_11)) (.cse2 (* main_~x~0 .cse0))) (and (not (= 0 (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse0 (+ .cse1 (+ (- (* (* 2 main_~x~0) v_main_~y~0_BEFORE_CALL_14)) .cse2))) .cse3)))) (= 0 (+ .cse3 (+ (+ .cse1 (+ (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))) .cse2)) .cse0))))))) (not (= (+ (+ (+ .cse4 (+ .cse5 (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))))) .cse6) .cse7) 0)) (= (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse6 (+ .cse4 (+ (- (* (* 2 v_main_~x~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_14)) .cse5))) .cse7)) 0))))) .cse8) (or (forall ((v_main_~v~0_BEFORE_CALL_11 Int) (v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~X~0_BEFORE_CALL_11 Int) (v_main_~Y~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_14 Int)) (let ((.cse15 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse13 (- v_main_~X~0_BEFORE_CALL_11)) (.cse14 (* .cse15 v_main_~x~0_BEFORE_CALL_11)) (.cse16 (- v_main_~v~0_BEFORE_CALL_11))) (or (exists ((main_~v~0 Int) (main_~x~0 Int)) (let ((.cse9 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse12 (- main_~v~0)) (.cse10 (- v_main_~X~0_BEFORE_CALL_11)) (.cse11 (* main_~x~0 .cse9))) (and (not (= 0 (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse9 (+ .cse10 (+ (- (* (* 2 main_~x~0) v_main_~y~0_BEFORE_CALL_14)) .cse11))) .cse12)))) (= 0 (+ .cse12 (+ (+ .cse10 (+ (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))) .cse11)) .cse9))))))) (= (+ (+ (+ .cse13 (+ .cse14 (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))))) .cse15) .cse16) 0) (= (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse15 (+ .cse13 (+ (- (* (* 2 v_main_~x~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_14)) .cse14))) .cse16)) 0))))) .cse17) (or .cse17 .cse8))) is different from true [2019-09-10 02:18:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:40,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:18:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 3 refuted. 4 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:18:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:18:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2019-09-10 02:18:40,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:40,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:18:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:18:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=4, NotChecked=22, Total=182 [2019-09-10 02:18:40,184 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 14 states. [2019-09-10 02:18:42,238 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (let ((.cse18 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse9 (not .cse0))) (and .cse0 (or (forall ((v_main_~v~0_BEFORE_CALL_11 Int) (v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~X~0_BEFORE_CALL_11 Int) (v_main_~Y~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_14 Int)) (let ((.cse7 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse5 (- v_main_~X~0_BEFORE_CALL_11)) (.cse6 (* .cse7 v_main_~x~0_BEFORE_CALL_11)) (.cse8 (- v_main_~v~0_BEFORE_CALL_11))) (or (exists ((main_~v~0 Int) (main_~x~0 Int)) (let ((.cse1 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse4 (- main_~v~0)) (.cse2 (- v_main_~X~0_BEFORE_CALL_11)) (.cse3 (* main_~x~0 .cse1))) (and (not (= 0 (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse1 (+ .cse2 (+ (- (* (* 2 main_~x~0) v_main_~y~0_BEFORE_CALL_14)) .cse3))) .cse4)))) (= 0 (+ .cse4 (+ (+ .cse2 (+ (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))) .cse3)) .cse1))))))) (not (= (+ (+ (+ .cse5 (+ .cse6 (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))))) .cse7) .cse8) 0)) (= (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse7 (+ .cse5 (+ (- (* (* 2 v_main_~x~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_14)) .cse6))) .cse8)) 0))))) .cse9) (or (forall ((v_main_~v~0_BEFORE_CALL_11 Int) (v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~X~0_BEFORE_CALL_11 Int) (v_main_~Y~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_14 Int)) (let ((.cse16 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse14 (- v_main_~X~0_BEFORE_CALL_11)) (.cse15 (* .cse16 v_main_~x~0_BEFORE_CALL_11)) (.cse17 (- v_main_~v~0_BEFORE_CALL_11))) (or (exists ((main_~v~0 Int) (main_~x~0 Int)) (let ((.cse10 (* 2 v_main_~Y~0_BEFORE_CALL_11))) (let ((.cse13 (- main_~v~0)) (.cse11 (- v_main_~X~0_BEFORE_CALL_11)) (.cse12 (* main_~x~0 .cse10))) (and (not (= 0 (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse10 (+ .cse11 (+ (- (* (* 2 main_~x~0) v_main_~y~0_BEFORE_CALL_14)) .cse12))) .cse13)))) (= 0 (+ .cse13 (+ (+ .cse11 (+ (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))) .cse12)) .cse10))))))) (= (+ (+ (+ .cse14 (+ .cse15 (- (* v_main_~y~0_BEFORE_CALL_14 (* 2 v_main_~X~0_BEFORE_CALL_11))))) .cse16) .cse17) 0) (= (+ (* 2 v_main_~y~0_BEFORE_CALL_14) (+ (+ .cse16 (+ .cse14 (+ (- (* (* 2 v_main_~x~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_14)) .cse15))) .cse17)) 0))))) .cse18) (or .cse18 .cse9) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)))) is different from false [2019-09-10 02:18:50,848 WARN L188 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2019-09-10 02:18:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:50,907 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-09-10 02:18:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:18:50,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-10 02:18:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:50,909 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:18:50,909 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:18:50,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=61, Invalid=180, Unknown=7, NotChecked=58, Total=306 [2019-09-10 02:18:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:18:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-09-10 02:18:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:18:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-09-10 02:18:50,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 34 [2019-09-10 02:18:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:50,918 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-09-10 02:18:50,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:18:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-09-10 02:18:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:18:50,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:50,919 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:50,920 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash -407934025, now seen corresponding path program 1 times [2019-09-10 02:18:50,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:50,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:50,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:50,925 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:50,925 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:50,925 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:18:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:50,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:50,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2019-09-10 02:18:50,953 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [22], [24], [26], [33], [36], [38], [41], [43], [44], [45], [46], [48], [49], [50] [2019-09-10 02:18:50,955 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:18:50,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:18:50,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:18:50,968 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 11. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Never found a fixpoint. Largest state had 9 variables. [2019-09-10 02:18:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:50,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:18:50,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:50,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:50,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:18:51,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:18:51,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:18:51,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:18:51,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-10 02:18:51,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:51,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:18:51,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:18:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:18:51,312 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 14 states. [2019-09-10 02:18:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:51,606 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-09-10 02:18:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:18:51,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-09-10 02:18:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:51,608 INFO L225 Difference]: With dead ends: 66 [2019-09-10 02:18:51,608 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 02:18:51,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:18:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 02:18:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2019-09-10 02:18:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:18:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-09-10 02:18:51,617 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 43 [2019-09-10 02:18:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:51,618 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-09-10 02:18:51,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:18:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-09-10 02:18:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:18:51,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:51,620 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:51,620 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash 74811131, now seen corresponding path program 2 times [2019-09-10 02:18:51,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:51,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:51,628 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:18:51,629 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:18:51,629 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:18:51,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:51,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:18:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:51,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:51,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:51,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:51,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:19:01,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:19:01,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:01,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:19:01,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 02:19:01,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:19:01,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:19:01,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-10 02:19:01,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:01,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:19:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:19:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:19:01,454 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 8 states. [2019-09-10 02:19:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:01,687 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-09-10 02:19:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:19:01,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-09-10 02:19:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:01,690 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:19:01,690 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 02:19:01,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:19:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 02:19:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-10 02:19:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:19:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-09-10 02:19:01,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 43 [2019-09-10 02:19:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:01,702 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-09-10 02:19:01,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:19:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-09-10 02:19:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:19:01,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:01,704 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:01,704 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash 293665849, now seen corresponding path program 3 times [2019-09-10 02:19:01,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:01,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:01,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:01,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:01,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:01,709 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:19:01,710 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:19:01,710 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:19:01,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:01,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:19:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:01,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:01,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:01,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:01,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:19:01,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:19:13,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:19:13,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:13,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:19:13,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:19:13,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:19:14,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:19:14,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-10 02:19:14,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:14,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:19:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:19:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:19:14,202 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 18 states. [2019-09-10 02:19:15,290 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-09-10 02:19:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:15,292 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2019-09-10 02:19:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:19:15,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-09-10 02:19:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:15,294 INFO L225 Difference]: With dead ends: 84 [2019-09-10 02:19:15,294 INFO L226 Difference]: Without dead ends: 84 [2019-09-10 02:19:15,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:19:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-10 02:19:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2019-09-10 02:19:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:19:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-09-10 02:19:15,303 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 43 [2019-09-10 02:19:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:15,304 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-09-10 02:19:15,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:19:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-09-10 02:19:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:19:15,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:15,306 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:15,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash 474160641, now seen corresponding path program 4 times [2019-09-10 02:19:15,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:15,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:15,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:15,311 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:19:15,312 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:19:15,312 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:19:15,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:15,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:19:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:15,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:15,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:15,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:15,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:15,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:19:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:15,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:19:15,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:15,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:19:15,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:19:15,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-10 02:19:15,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:15,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:19:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:19:15,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:19:15,747 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 18 states. [2019-09-10 02:19:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:16,327 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2019-09-10 02:19:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:19:16,328 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-09-10 02:19:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:16,330 INFO L225 Difference]: With dead ends: 114 [2019-09-10 02:19:16,330 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 02:19:16,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:19:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 02:19:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2019-09-10 02:19:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-10 02:19:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2019-09-10 02:19:16,342 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 52 [2019-09-10 02:19:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:16,342 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2019-09-10 02:19:16,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:19:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2019-09-10 02:19:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:19:16,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:16,344 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:16,344 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 956905797, now seen corresponding path program 5 times [2019-09-10 02:19:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:16,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:16,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:19:16,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:19:16,350 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:19:16,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:16,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:19:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:16,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:16,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:16,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:16,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:16,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:19:16,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:19:21,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:19:21,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:21,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 02:19:21,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:19:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:19:21,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:21,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:19:24,188 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-10 02:19:24,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:19:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 02:19:26,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:19:26,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-09-10 02:19:26,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:26,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:19:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:19:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=244, Unknown=4, NotChecked=0, Total=306 [2019-09-10 02:19:26,608 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 18 states. [2019-09-10 02:19:41,167 WARN L188 SmtUtils]: Spent 13.73 s on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 02:19:47,612 WARN L188 SmtUtils]: Spent 4.30 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 02:19:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:51,024 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-09-10 02:19:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:19:51,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-09-10 02:19:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:51,026 INFO L225 Difference]: With dead ends: 117 [2019-09-10 02:19:51,026 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:19:51,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=114, Invalid=479, Unknown=7, NotChecked=0, Total=600 [2019-09-10 02:19:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:19:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:19:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:19:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:19:51,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-09-10 02:19:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:51,028 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:19:51,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:19:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:19:51,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:19:51,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:19:51 BoogieIcfgContainer [2019-09-10 02:19:51,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:19:51,036 INFO L168 Benchmark]: Toolchain (without parser) took 89537.06 ms. Allocated memory was 136.3 MB in the beginning and 294.1 MB in the end (delta: 157.8 MB). Free memory was 91.2 MB in the beginning and 199.6 MB in the end (delta: -108.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,037 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.42 ms. Allocated memory is still 136.3 MB. Free memory was 91.0 MB in the beginning and 81.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,039 INFO L168 Benchmark]: Boogie Preprocessor took 117.42 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 81.5 MB in the beginning and 178.6 MB in the end (delta: -97.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,040 INFO L168 Benchmark]: RCFGBuilder took 251.71 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 166.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,041 INFO L168 Benchmark]: TraceAbstraction took 88907.41 ms. Allocated memory was 201.9 MB in the beginning and 294.1 MB in the end (delta: 92.3 MB). Free memory was 166.2 MB in the beginning and 199.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:19:51,044 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.42 ms. Allocated memory is still 136.3 MB. Free memory was 91.0 MB in the beginning and 81.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.42 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 81.5 MB in the beginning and 178.6 MB in the end (delta: -97.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 251.71 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 166.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88907.41 ms. Allocated memory was 201.9 MB in the beginning and 294.1 MB in the end (delta: 92.3 MB). Free memory was 166.2 MB in the beginning and 199.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 88.8s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 142 SDslu, 1057 SDs, 0 SdLazy, 1299 SolverSat, 146 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 685 GetRequests, 518 SyntacticMatches, 7 SemanticMatches, 160 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 46.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 68 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 26.7s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 652 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 633 ConstructedInterpolants, 57 QuantifiedInterpolants, 185328 SizeOfPredicates, 37 NumberOfNonLiveVariables, 710 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 531/792 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...