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-673a906-m [2019-10-03 02:36:13,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:36:13,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:36:13,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:36:13,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:36:13,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:36:13,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:36:13,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:36:13,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:36:13,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:36:13,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:36:13,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:36:13,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:36:13,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:36:13,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:36:13,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:36:13,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:36:13,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:36:13,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:36:13,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:36:13,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:36:13,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:36:13,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:36:13,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:36:13,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:36:13,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:36:13,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:36:13,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:36:13,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:36:13,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:36:13,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:36:13,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:36:13,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:36:13,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:36:13,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:36:13,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:36:13,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:36:13,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:36:13,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:36:13,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:36:13,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:36:13,495 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-10-03 02:36:13,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:36:13,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:36:13,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:36:13,515 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:36:13,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:36:13,516 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:36:13,517 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:36:13,517 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:36:13,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:36:13,517 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:36:13,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:36:13,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:36:13,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:36:13,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:36:13,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:36:13,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:36:13,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:36:13,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:36:13,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:36:13,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:36:13,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:36:13,521 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:36:13,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:36:13,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:36:13,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:36:13,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:36:13,522 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:36:13,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:36:13,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:36:13,523 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:36:13,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:36:13,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:36:13,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:36:13,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:36:13,584 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:36:13,585 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps5.c [2019-10-03 02:36:13,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366e37bcb/091a5134743341c684ff7e9012f9c758/FLAGbec7d2f6d [2019-10-03 02:36:14,014 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:36:14,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5.c [2019-10-03 02:36:14,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366e37bcb/091a5134743341c684ff7e9012f9c758/FLAGbec7d2f6d [2019-10-03 02:36:14,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/366e37bcb/091a5134743341c684ff7e9012f9c758 [2019-10-03 02:36:14,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:36:14,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:36:14,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:36:14,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:36:14,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:36:14,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8a50b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14, skipping insertion in model container [2019-10-03 02:36:14,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:36:14,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:36:14,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:36:14,695 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:36:14,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:36:14,742 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:36:14,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14 WrapperNode [2019-10-03 02:36:14,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:36:14,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:36:14,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:36:14,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:36:14,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... [2019-10-03 02:36:14,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:36:14,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:36:14,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:36:14,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:36:14,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:36:14,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:36:14,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:36:14,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:36:14,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:36:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:36:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:36:15,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:36:15,121 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:36:15,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:36:15 BoogieIcfgContainer [2019-10-03 02:36:15,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:36:15,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:36:15,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:36:15,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:36:15,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:36:14" (1/3) ... [2019-10-03 02:36:15,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfedd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:36:15, skipping insertion in model container [2019-10-03 02:36:15,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:36:14" (2/3) ... [2019-10-03 02:36:15,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfedd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:36:15, skipping insertion in model container [2019-10-03 02:36:15,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:36:15" (3/3) ... [2019-10-03 02:36:15,132 INFO L109 eAbstractionObserver]: Analyzing ICFG ps5.c [2019-10-03 02:36:15,164 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:36:15,183 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:36:15,206 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:36:15,251 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:36:15,251 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:36:15,252 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:36:15,252 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:36:15,252 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:36:15,252 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:36:15,252 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:36:15,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:36:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-03 02:36:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:36:15,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:15,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:15,295 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash -148746498, now seen corresponding path program 1 times [2019-10-03 02:36:15,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:15,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:36:15,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:36:15,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:36:15,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:36:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:36:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:36:15,424 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-03 02:36:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:15,441 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-03 02:36:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:36:15,443 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-03 02:36:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:15,450 INFO L225 Difference]: With dead ends: 21 [2019-10-03 02:36:15,450 INFO L226 Difference]: Without dead ends: 16 [2019-10-03 02:36:15,452 INFO L640 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-10-03 02:36:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-03 02:36:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-03 02:36:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-03 02:36:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-03 02:36:15,489 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-10-03 02:36:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:15,490 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-03 02:36:15,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:36:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-03 02:36:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:36:15,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:15,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:15,492 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -156194248, now seen corresponding path program 1 times [2019-10-03 02:36:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:15,500 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:36:15,501 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:36:15,501 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-10-03 02:36:15,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:36:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:15,542 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-10-03 02:36:15,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:15,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:15,543 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-10-03 02:36:15,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:15,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 02:36:15,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:15,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:15,795 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:36:15,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-03 02:36:15,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:36:15,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:36:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:36:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:36:15,798 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2019-10-03 02:36:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:15,931 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-10-03 02:36:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:36:15,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-03 02:36:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:15,933 INFO L225 Difference]: With dead ends: 25 [2019-10-03 02:36:15,933 INFO L226 Difference]: Without dead ends: 23 [2019-10-03 02:36:15,935 INFO L640 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-10-03 02:36:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-03 02:36:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-03 02:36:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-03 02:36:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-03 02:36:15,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-10-03 02:36:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:15,950 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-03 02:36:15,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:36:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-03 02:36:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:36:15,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:15,951 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:15,952 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1425845280, now seen corresponding path program 1 times [2019-10-03 02:36:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:15,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:15,959 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:36:15,959 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:36:15,959 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) [2019-10-03 02:36:15,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:15,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:36:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:16,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:36:16,002 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2019-10-03 02:36:16,039 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:36:16,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:36:16,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:36:16,197 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-10-03 02:36:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:16,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:36:16,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:16,201 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-10-03 02:36:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:16,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:16,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 02:36:16,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:16,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:16,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:16,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:16,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:36:16,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-10-03 02:36:16,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:16,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:36:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:36:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:36:16,597 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-10-03 02:36:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:16,762 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-10-03 02:36:16,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:36:16,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-10-03 02:36:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:16,763 INFO L225 Difference]: With dead ends: 32 [2019-10-03 02:36:16,764 INFO L226 Difference]: Without dead ends: 30 [2019-10-03 02:36:16,764 INFO L640 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-10-03 02:36:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-03 02:36:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-10-03 02:36:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-03 02:36:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-03 02:36:16,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2019-10-03 02:36:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:16,770 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-03 02:36:16,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:36:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-03 02:36:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:36:16,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:16,772 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:16,772 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1054216485, now seen corresponding path program 1 times [2019-10-03 02:36:16,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:16,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:16,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:36:16,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:36:16,781 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-10-03 02:36:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:16,804 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-10-03 02:36:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:16,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-10-03 02:36:16,818 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43], [44], [45], [46] [2019-10-03 02:36:16,828 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:36:16,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:36:16,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:36:16,872 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-10-03 02:36:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:16,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:36:16,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:16,872 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-10-03 02:36:16,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:16,897 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-10-03 02:36:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:16,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-03 02:36:16,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:17,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:36:17,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:19,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:28,416 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-03 02:36:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:28,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:36:37,809 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) (v_main_~c~0_BEFORE_CALL_4 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (main_~k~0 Int)) (or (exists ((v_prenex_1 Int)) (and (< v_main_~c~0_BEFORE_CALL_4 v_prenex_1) (not (let ((.cse1 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse1 .cse1) (* .cse1 v_prenex_1)))) (<= v_prenex_1 (+ v_main_~c~0_BEFORE_CALL_4 1)))) (<= main_~k~0 v_main_~c~0_BEFORE_CALL_4) (< (+ v_main_~c~0_BEFORE_CALL_4 1) main_~k~0) (let ((.cse2 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse2 .cse2) (* main_~k~0 .cse2))) (= (+ (+ (+ (* (* (* 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_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 ((.cse3 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse3 .cse3) (* main_~k~0 .cse3))) (= (+ (+ (+ (* (* (* 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 ((.cse4 (+ v_main_~y~0_BEFORE_CALL_11 1))) (= (* .cse4 .cse4) (* main_~k~0 .cse4))))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| 1))))) is different from true [2019-10-03 02:36:41,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-03 02:36:46,113 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-10-03 02:36:50,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-03 02:36:57,142 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-10-03 02:36:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 6 times theorem prover too weak. 6 trivial. 1 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:36:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:36:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-10-03 02:36:57,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:57,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 02:36:57,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 02:36:57,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=147, Unknown=5, NotChecked=78, Total=272 [2019-10-03 02:36:57,167 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2019-10-03 02:36:59,369 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-10-03 02:37:00,138 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-10-03 02:37:00,550 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-10-03 02:37:19,763 WARN L191 SmtUtils]: Spent 9.53 s on a formula simplification that was a NOOP. DAG size: 19 [2019-10-03 02:37:31,875 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-10-03 02:37:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,989 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-10-03 02:37:40,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:37:40,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-10-03 02:37:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,996 INFO L225 Difference]: With dead ends: 41 [2019-10-03 02:37:40,996 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:37:40,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=76, Invalid=239, Unknown=11, NotChecked=180, Total=506 [2019-10-03 02:37:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:37:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-03 02:37:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-03 02:37:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-03 02:37:41,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2019-10-03 02:37:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,006 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-03 02:37:41,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 02:37:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-03 02:37:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:37:41,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,008 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:41,008 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -705610227, now seen corresponding path program 2 times [2019-10-03 02:37:41,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:41,015 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:37:41,015 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:37:41,015 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-10-03 02:37:41,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:41,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:37:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:41,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:41,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:41,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:41,062 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-10-03 02:37:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:37:41,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:37:41,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-03 02:37:41,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:41,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-03 02:37:41,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:41,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:37:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:37:41,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:12,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:31,284 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-03 02:38:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 32 refuted. 14 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:38:31,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:38:31,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-03 02:38:31,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:31,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 02:38:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 02:38:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=359, Unknown=22, NotChecked=0, Total=462 [2019-10-03 02:38:31,368 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 22 states. [2019-10-03 02:38:44,260 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-10-03 02:38:54,541 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-10-03 02:39:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:05,185 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-03 02:39:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:39:05,186 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-10-03 02:39:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:05,187 INFO L225 Difference]: With dead ends: 37 [2019-10-03 02:39:05,187 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:05,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=172, Invalid=733, Unknown=25, NotChecked=0, Total=930 [2019-10-03 02:39:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:05,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-10-03 02:39:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:05,189 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:05,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 02:39:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:05,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:05,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:05 BoogieIcfgContainer [2019-10-03 02:39:05,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:05,197 INFO L168 Benchmark]: Toolchain (without parser) took 170794.44 ms. Allocated memory was 130.5 MB in the beginning and 267.9 MB in the end (delta: 137.4 MB). Free memory was 86.9 MB in the beginning and 76.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 148.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,198 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.31 ms. Allocated memory is still 130.5 MB. Free memory was 86.6 MB in the beginning and 77.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,200 INFO L168 Benchmark]: Boogie Preprocessor took 127.27 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 77.0 MB in the beginning and 175.0 MB in the end (delta: -98.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,201 INFO L168 Benchmark]: RCFGBuilder took 251.76 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 163.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,202 INFO L168 Benchmark]: TraceAbstraction took 170071.24 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 163.0 MB in the beginning and 76.0 MB in the end (delta: 86.9 MB). Peak memory consumption was 156.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:05,206 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.31 ms. Allocated memory is still 130.5 MB. Free memory was 86.6 MB in the beginning and 77.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.27 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 77.0 MB in the beginning and 175.0 MB in the end (delta: -98.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 251.76 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 163.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170071.24 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 163.0 MB in the beginning and 76.0 MB in the end (delta: 86.9 MB). Peak memory consumption was 156.1 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, 169.9s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 77.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 66 SDslu, 388 SDs, 0 SdLazy, 425 SolverSat, 54 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 115.5s 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, 90.9s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 209 ConstructedInterpolants, 18 QuantifiedInterpolants, 60832 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...