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/ps5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:15:06,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:15:06,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:15:06,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:15:06,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:15:06,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:15:06,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:15:06,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:15:06,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:15:06,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:15:06,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:15:06,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:15:06,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:15:06,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:15:06,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:15:06,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:15:06,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:15:06,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:15:06,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:15:06,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:15:06,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:15:06,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:15:06,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:15:06,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:15:06,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:15:06,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:15:06,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:15:06,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:15:06,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:15:06,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:15:06,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:15:06,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:15:06,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:15:06,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:15:06,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:15:06,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:15:06,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:15:06,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:15:06,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:15:06,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:15:06,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:15:06,218 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-03 21:15:06,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:15:06,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:15:06,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:15:06,240 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:15:06,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:15:06,241 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:15:06,241 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:15:06,241 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:15:06,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:15:06,241 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:15:06,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:15:06,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:15:06,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:15:06,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:15:06,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:15:06,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:15:06,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:15:06,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:15:06,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:15:06,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:15:06,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:15:06,245 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:15:06,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:15:06,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:15:06,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:15:06,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:15:06,247 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:15:06,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:15:06,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:15:06,247 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:15:06,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:15:06,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:15:06,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:15:06,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:15:06,317 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:15:06,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps5.c [2019-09-03 21:15:06,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc84e736/65fba863fd7e453795b8702b31d6f9c3/FLAGed3e05057 [2019-09-03 21:15:06,812 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:15:06,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5.c [2019-09-03 21:15:06,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc84e736/65fba863fd7e453795b8702b31d6f9c3/FLAGed3e05057 [2019-09-03 21:15:07,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc84e736/65fba863fd7e453795b8702b31d6f9c3 [2019-09-03 21:15:07,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:15:07,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:15:07,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:15:07,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:15:07,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:15:07,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5748c03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07, skipping insertion in model container [2019-09-03 21:15:07,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:15:07,252 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:15:07,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:15:07,402 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:15:07,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:15:07,436 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:15:07,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07 WrapperNode [2019-09-03 21:15:07,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:15:07,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:15:07,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:15:07,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:15:07,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (1/1) ... [2019-09-03 21:15:07,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:15:07,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:15:07,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:15:07,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:15:07,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (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-03 21:15:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:15:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:15:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:15:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:15:07,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:15:07,778 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 21:15:07,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:15:07 BoogieIcfgContainer [2019-09-03 21:15:07,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:15:07,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:15:07,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:15:07,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:15:07,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:15:07" (1/3) ... [2019-09-03 21:15:07,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b766cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:15:07, skipping insertion in model container [2019-09-03 21:15:07,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:15:07" (2/3) ... [2019-09-03 21:15:07,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b766cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:15:07, skipping insertion in model container [2019-09-03 21:15:07,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:15:07" (3/3) ... [2019-09-03 21:15:07,787 INFO L109 eAbstractionObserver]: Analyzing ICFG ps5.c [2019-09-03 21:15:07,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:15:07,803 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:15:07,819 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:15:07,841 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:15:07,842 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:15:07,842 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:15:07,842 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:15:07,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:15:07,842 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:15:07,843 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:15:07,843 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:15:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 21:15:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:15:07,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:07,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:07,869 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:07,874 INFO L82 PathProgramCache]: Analyzing trace with hash -148746498, now seen corresponding path program 1 times [2019-09-03 21:15:07,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:07,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:07,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:07,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:07,963 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-03 21:15:07,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:15:07,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:15:07,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:15:07,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:15:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:15:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:15:07,986 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-03 21:15:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:08,004 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-03 21:15:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:15:08,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:15:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:08,017 INFO L225 Difference]: With dead ends: 21 [2019-09-03 21:15:08,017 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:15:08,020 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-03 21:15:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:15:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 21:15:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 21:15:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 21:15:08,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-03 21:15:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:08,069 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 21:15:08,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:15:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 21:15:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:15:08,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:08,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:08,072 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:08,074 INFO L82 PathProgramCache]: Analyzing trace with hash -156194248, now seen corresponding path program 1 times [2019-09-03 21:15:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:08,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:08,088 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:15:08,088 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:15:08,088 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) [2019-09-03 21:15:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:15:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:08,119 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-03 21:15:08,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:08,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:08,121 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-03 21:15:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:15:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:08,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 21:15:08,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:08,288 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-03 21:15:08,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:08,425 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-03 21:15:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:15:08,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:15:08,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:15:08,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:15:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:15:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:15:08,432 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2019-09-03 21:15:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:08,549 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-03 21:15:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:15:08,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 21:15:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:08,551 INFO L225 Difference]: With dead ends: 25 [2019-09-03 21:15:08,551 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 21:15:08,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:15:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 21:15:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 21:15:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 21:15:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 21:15:08,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-09-03 21:15:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:08,565 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 21:15:08,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:15:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 21:15:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 21:15:08,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:08,568 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:08,568 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1425845280, now seen corresponding path program 1 times [2019-09-03 21:15:08,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:08,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:08,583 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:15:08,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:15:08,584 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-03 21:15:08,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:15:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:08,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 21:15:08,634 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2019-09-03 21:15:08,671 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:15:08,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:15:08,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:15:08,842 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 12 root evaluator evaluations with a maximum evaluation depth of 14. Performed 12 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 5 variables. [2019-09-03 21:15:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:08,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:15:08,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:08,846 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-03 21:15:08,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:08,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:15:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:08,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 21:15:08,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:08,972 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-03 21:15:08,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:09,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:09,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:09,226 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-03 21:15:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:15:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-09-03 21:15:09,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:09,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:15:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:15:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:15:09,231 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-09-03 21:15:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:09,426 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-03 21:15:09,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:15:09,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 21:15:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:09,428 INFO L225 Difference]: With dead ends: 32 [2019-09-03 21:15:09,428 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 21:15:09,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:15:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 21:15:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-03 21:15:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 21:15:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-03 21:15:09,440 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2019-09-03 21:15:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:09,441 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-03 21:15:09,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:15:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-03 21:15:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 21:15:09,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:09,443 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:09,444 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1054216485, now seen corresponding path program 1 times [2019-09-03 21:15:09,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:09,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:09,462 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:15:09,462 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:15:09,462 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) [2019-09-03 21:15:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:09,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:15:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:09,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-09-03 21:15:09,493 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43], [44], [45], [46] [2019-09-03 21:15:09,495 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:15:09,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:15:09,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:15:09,527 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 12 root evaluator evaluations with a maximum evaluation depth of 14. Performed 12 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 5 variables. [2019-09-03 21:15:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:09,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:15:09,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:09,527 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) [2019-09-03 21:15:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:09,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:09,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 21:15:09,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:09,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 21:15:09,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:11,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:23,406 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-03 21:15:23,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:23,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:31,794 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_5 Int) (main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_11 Int)) (or (exists ((main_~x~0 Int)) (= 0 (+ (- v_main_~y~0_BEFORE_CALL_11) (+ (- (* 30 main_~x~0)) (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))))))) (let ((.cse1 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse1 .cse1) (* main_~k~0 .cse1))) (= (+ (+ (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))) (- (* 30 v_main_~x~0_BEFORE_CALL_5))) (- v_main_~y~0_BEFORE_CALL_11)) 0)))) (or (forall ((main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_11 Int)) (or (exists ((main_~x~0 Int)) (= 0 (+ (- v_main_~y~0_BEFORE_CALL_11) (+ (- (* 30 main_~x~0)) (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))))))) (let ((.cse2 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse2 .cse2) (* main_~k~0 .cse2))))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| 1))))) is different from true [2019-09-03 21:15:35,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-03 21:15:39,968 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_5 Int) (main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_11 Int)) (or (exists ((main_~x~0 Int)) (= 0 (+ (- v_main_~y~0_BEFORE_CALL_11) (+ (- (* 30 main_~x~0)) (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))))))) (let ((.cse1 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse1 .cse1) (* main_~k~0 .cse1))) (= (+ (+ (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))) (- (* 30 v_main_~x~0_BEFORE_CALL_5))) (- v_main_~y~0_BEFORE_CALL_11)) 0)))) (or .cse0 (forall ((v_prenex_2 Int) (v_prenex_3 Int)) (or (exists ((v_prenex_4 Int)) (= (+ (- v_prenex_2) (+ (- (* 30 v_prenex_4)) (+ (+ (* (* (* (* 15 v_prenex_2) v_prenex_2) v_prenex_2) v_prenex_2) (* (* (* v_prenex_2 (* (* 6 v_prenex_2) v_prenex_2)) v_prenex_2) v_prenex_2)) (* v_prenex_2 (* (* 10 v_prenex_2) v_prenex_2))))) 0)) (let ((.cse2 (+ v_prenex_2 1))) (= (* .cse2 .cse2) (* .cse2 v_prenex_3))))) (not (= |c___VERIFIER_assert_#in~cond| 1))))) is different from true [2019-09-03 21:15:43,981 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-03 21:15:50,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse2 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_5 Int) (main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_11 Int)) (or (exists ((main_~x~0 Int)) (= 0 (+ (- v_main_~y~0_BEFORE_CALL_11) (+ (- (* 30 main_~x~0)) (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))))))) (let ((.cse1 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse1 .cse1) (* main_~k~0 .cse1))) (= (+ (+ (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))) (- (* 30 v_main_~x~0_BEFORE_CALL_5))) (- v_main_~y~0_BEFORE_CALL_11)) 0))) .cse2) (or .cse0 (forall ((v_prenex_2 Int) (v_prenex_3 Int)) (or (exists ((v_prenex_4 Int)) (= (+ (- v_prenex_2) (+ (- (* 30 v_prenex_4)) (+ (+ (* (* (* (* 15 v_prenex_2) v_prenex_2) v_prenex_2) v_prenex_2) (* (* (* v_prenex_2 (* (* 6 v_prenex_2) v_prenex_2)) v_prenex_2) v_prenex_2)) (* v_prenex_2 (* (* 10 v_prenex_2) v_prenex_2))))) 0)) (let ((.cse3 (+ v_prenex_2 1))) (= (* .cse3 .cse3) (* .cse3 v_prenex_3))))) (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse2))) is different from true [2019-09-03 21:15:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 6 times theorem prover too weak. 6 trivial. 1 not checked. [2019-09-03 21:15:50,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:15:50,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-09-03 21:15:50,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:50,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:15:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:15:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=146, Unknown=6, NotChecked=78, Total=272 [2019-09-03 21:15:50,328 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2019-09-03 21:15:52,569 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse2 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_5 Int) (main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_11 Int)) (or (exists ((main_~x~0 Int)) (= 0 (+ (- v_main_~y~0_BEFORE_CALL_11) (+ (- (* 30 main_~x~0)) (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))))))) (let ((.cse1 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse1 .cse1) (* main_~k~0 .cse1))) (= (+ (+ (+ (* (* (* 10 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (+ (* (* (* v_main_~y~0_BEFORE_CALL_11 (* (* 6 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11)) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) (* (* (* (* 15 v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11) v_main_~y~0_BEFORE_CALL_11))) (- (* 30 v_main_~x~0_BEFORE_CALL_5))) (- v_main_~y~0_BEFORE_CALL_11)) 0))) .cse2) (or .cse0 (forall ((v_prenex_2 Int) (v_prenex_3 Int)) (or (exists ((v_prenex_4 Int)) (= (+ (- v_prenex_2) (+ (- (* 30 v_prenex_4)) (+ (+ (* (* (* (* 15 v_prenex_2) v_prenex_2) v_prenex_2) v_prenex_2) (* (* (* v_prenex_2 (* (* 6 v_prenex_2) v_prenex_2)) v_prenex_2) v_prenex_2)) (* v_prenex_2 (* (* 10 v_prenex_2) v_prenex_2))))) 0)) (let ((.cse3 (+ v_prenex_2 1))) (= (* .cse3 .cse3) (* .cse3 v_prenex_3))))) (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse2) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from true [2019-09-03 21:15:53,180 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-09-03 21:16:10,561 WARN L188 SmtUtils]: Spent 7.97 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-03 21:16:14,681 WARN L838 $PredicateComparison]: unable to prove that (and (= (* c_main_~k~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (let ((.cse0 (+ c_main_~y~0 1))) (= (* main_~k~0 .cse0) (* .cse0 .cse0))) (<= main_~k~0 c_main_~c~0)))) is different from false [2019-09-03 21:16:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:25,763 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-09-03 21:16:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:16:25,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-09-03 21:16:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:25,766 INFO L225 Difference]: With dead ends: 41 [2019-09-03 21:16:25,766 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:16:25,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=76, Invalid=237, Unknown=13, NotChecked=180, Total=506 [2019-09-03 21:16:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:16:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 21:16:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 21:16:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 21:16:25,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2019-09-03 21:16:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:25,775 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 21:16:25,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:16:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 21:16:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 21:16:25,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:25,777 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:25,778 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -705610227, now seen corresponding path program 2 times [2019-09-03 21:16:25,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:25,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:25,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:25,784 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:16:25,784 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:16:25,784 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-03 21:16:25,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:25,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:16:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:25,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:25,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:25,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:25,824 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-03 21:16:25,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:16:25,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:16:26,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:16:26,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:26,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 21:16:26,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:26,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 21:16:26,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:17:13,222 WARN L188 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-03 21:17:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:17:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:17:13,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:17:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 29 refuted. 17 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 21:17:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:17:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-09-03 21:17:13,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:17:13,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 21:17:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 21:17:13,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=360, Unknown=21, NotChecked=0, Total=462 [2019-09-03 21:17:13,304 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 22 states. [2019-09-03 21:17:25,891 WARN L188 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-09-03 21:17:31,578 WARN L188 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-09-03 21:17:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:17:38,738 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-03 21:17:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 21:17:38,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-09-03 21:17:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:17:38,740 INFO L225 Difference]: With dead ends: 37 [2019-09-03 21:17:38,740 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 21:17:38,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 67.2s TimeCoverageRelationStatistics Valid=172, Invalid=736, Unknown=22, NotChecked=0, Total=930 [2019-09-03 21:17:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 21:17:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 21:17:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 21:17:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 21:17:38,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-03 21:17:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:17:38,742 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 21:17:38,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 21:17:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 21:17:38,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 21:17:38,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 09:17:38 BoogieIcfgContainer [2019-09-03 21:17:38,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 21:17:38,748 INFO L168 Benchmark]: Toolchain (without parser) took 151531.83 ms. Allocated memory was 140.0 MB in the beginning and 259.0 MB in the end (delta: 119.0 MB). Free memory was 86.2 MB in the beginning and 84.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,749 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.98 ms. Allocated memory is still 140.0 MB. Free memory was 86.0 MB in the beginning and 76.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,751 INFO L168 Benchmark]: Boogie Preprocessor took 113.28 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 76.5 MB in the beginning and 176.8 MB in the end (delta: -100.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,752 INFO L168 Benchmark]: RCFGBuilder took 228.69 ms. Allocated memory is still 199.2 MB. Free memory was 176.8 MB in the beginning and 165.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,753 INFO L168 Benchmark]: TraceAbstraction took 150966.03 ms. Allocated memory was 199.2 MB in the beginning and 259.0 MB in the end (delta: 59.8 MB). Free memory was 165.3 MB in the beginning and 84.5 MB in the end (delta: 80.7 MB). Peak memory consumption was 140.5 MB. Max. memory is 7.1 GB. [2019-09-03 21:17:38,757 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 219.98 ms. Allocated memory is still 140.0 MB. Free memory was 86.0 MB in the beginning and 76.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.28 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 76.5 MB in the beginning and 176.8 MB in the end (delta: -100.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 228.69 ms. Allocated memory is still 199.2 MB. Free memory was 176.8 MB in the beginning and 165.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150966.03 ms. Allocated memory was 199.2 MB in the beginning and 259.0 MB in the end (delta: 59.8 MB). Free memory was 165.3 MB in the beginning and 84.5 MB in the end (delta: 80.7 MB). Peak memory consumption was 140.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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, 21 locations, 1 error locations. SAFE Result, 150.9s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 61.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 66 SDslu, 388 SDs, 0 SdLazy, 431 SolverSat, 55 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 109.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 88.6s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 209 ConstructedInterpolants, 18 QuantifiedInterpolants, 58375 SizeOfPredicates, 18 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 138/254 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...