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-0883e75 [2019-09-05 13:22:28,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:22:28,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:22:28,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:22:28,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:22:28,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:22:28,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:22:28,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:22:28,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:22:28,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:22:28,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:22:28,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:22:28,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:22:28,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:22:28,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:22:28,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:22:28,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:22:28,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:22:28,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:22:28,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:22:28,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:22:28,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:22:28,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:22:28,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:22:28,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:22:28,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:22:28,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:22:28,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:22:28,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:22:28,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:22:28,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:22:28,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:22:28,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:22:28,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:22:28,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:22:28,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:22:28,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:22:28,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:22:28,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:22:28,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:22:28,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:22:28,329 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-05 13:22:28,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:22:28,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:22:28,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:22:28,353 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:22:28,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:22:28,354 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:22:28,354 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:22:28,354 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:22:28,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:22:28,355 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:22:28,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:22:28,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:22:28,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:22:28,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:22:28,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:22:28,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:22:28,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:22:28,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:22:28,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:22:28,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:22:28,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:22:28,358 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:22:28,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:22:28,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:22:28,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:22:28,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:22:28,359 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:22:28,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:22:28,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:22:28,359 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:22:28,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:22:28,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:22:28,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:22:28,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:22:28,403 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:22:28,404 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-05 13:22:28,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ffc813e/8b1517d5b0c540b1ad36609d1bfc6409/FLAG3a8e13a33 [2019-09-05 13:22:28,863 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:22:28,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5.c [2019-09-05 13:22:28,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ffc813e/8b1517d5b0c540b1ad36609d1bfc6409/FLAG3a8e13a33 [2019-09-05 13:22:29,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ffc813e/8b1517d5b0c540b1ad36609d1bfc6409 [2019-09-05 13:22:29,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:22:29,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:22:29,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:22:29,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:22:29,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:22:29,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eca2f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29, skipping insertion in model container [2019-09-05 13:22:29,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,308 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:22:29,324 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:22:29,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:22:29,490 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:22:29,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:22:29,521 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:22:29,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29 WrapperNode [2019-09-05 13:22:29,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:22:29,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:22:29,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:22:29,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:22:29,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (1/1) ... [2019-09-05 13:22:29,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:22:29,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:22:29,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:22:29,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:22:29,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (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-05 13:22:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:22:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:22:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:22:29,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:22:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:22:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:22:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:22:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:22:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:22:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:22:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:22:29,862 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:22:29,862 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:22:29,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:22:29 BoogieIcfgContainer [2019-09-05 13:22:29,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:22:29,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:22:29,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:22:29,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:22:29,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:22:29" (1/3) ... [2019-09-05 13:22:29,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70985bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:22:29, skipping insertion in model container [2019-09-05 13:22:29,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:22:29" (2/3) ... [2019-09-05 13:22:29,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70985bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:22:29, skipping insertion in model container [2019-09-05 13:22:29,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:22:29" (3/3) ... [2019-09-05 13:22:29,870 INFO L109 eAbstractionObserver]: Analyzing ICFG ps5.c [2019-09-05 13:22:29,879 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:22:29,886 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:22:29,902 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:22:29,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:22:29,928 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:22:29,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:22:29,928 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:22:29,928 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:22:29,928 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:22:29,929 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:22:29,929 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:22:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-05 13:22:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:22:29,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:29,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:29,951 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -148746498, now seen corresponding path program 1 times [2019-09-05 13:22:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:29,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:29,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:30,045 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-05 13:22:30,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:22:30,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:22:30,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:22:30,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:22:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:22:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:22:30,063 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-05 13:22:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:30,081 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-05 13:22:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:22:30,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:22:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:30,091 INFO L225 Difference]: With dead ends: 21 [2019-09-05 13:22:30,091 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:22:30,093 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-05 13:22:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:22:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 13:22:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 13:22:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-05 13:22:30,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-05 13:22:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:30,132 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-05 13:22:30,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:22:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-05 13:22:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:22:30,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:30,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:30,135 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -156194248, now seen corresponding path program 1 times [2019-09-05 13:22:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:30,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:30,152 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:22:30,152 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:22:30,152 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-05 13:22:30,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:30,175 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-05 13:22:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:30,195 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:22:30,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:30,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:30,196 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) [2019-09-05 13:22:30,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:30,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:22:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:30,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:22:30,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:30,433 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-05 13:22:30,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:30,589 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-05 13:22:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:22:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:22:30,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:22:30,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:22:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:22:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:22:30,596 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2019-09-05 13:22:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:30,704 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-05 13:22:30,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:22:30,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-05 13:22:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:30,706 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:22:30,707 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 13:22:30,708 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-05 13:22:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 13:22:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 13:22:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:22:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-05 13:22:30,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-09-05 13:22:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:30,717 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-05 13:22:30,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:22:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-05 13:22:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:22:30,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:30,718 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:30,719 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1425845280, now seen corresponding path program 1 times [2019-09-05 13:22:30,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:30,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:30,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:30,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:30,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:30,725 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:22:30,726 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:22:30,726 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-05 13:22:30,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:30,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:22:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:30,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-05 13:22:30,767 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2019-09-05 13:22:30,810 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:22:30,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:22:30,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:22:31,001 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-05 13:22:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:31,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:22:31,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:31,008 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-05 13:22:31,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:31,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:22:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:31,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:22:31,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:31,128 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-05 13:22:31,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:31,406 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-05 13:22:31,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:22:31,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-09-05 13:22:31,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:31,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:22:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:22:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:22:31,411 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-09-05 13:22:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:31,566 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-05 13:22:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:22:31,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-05 13:22:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:31,568 INFO L225 Difference]: With dead ends: 32 [2019-09-05 13:22:31,568 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 13:22:31,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:22:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 13:22:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-05 13:22:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 13:22:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-05 13:22:31,574 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2019-09-05 13:22:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:31,575 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-05 13:22:31,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:22:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-05 13:22:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:22:31,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:31,576 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-05 13:22:31,577 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1054216485, now seen corresponding path program 1 times [2019-09-05 13:22:31,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:31,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:31,583 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:22:31,583 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:22:31,583 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-05 13:22:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:31,601 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-05 13:22:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:31,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-09-05 13:22:31,615 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [17], [19], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43], [44], [45], [46] [2019-09-05 13:22:31,617 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:22:31,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:22:31,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:22:31,652 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-05 13:22:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:31,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:22:31,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:31,653 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-05 13:22:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:31,677 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-05 13:22:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:31,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:22:31,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:31,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:31,811 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-05 13:22:31,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:34,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:44,410 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 13:22:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:44,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:50,679 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-05 13:22:54,696 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-05 13:23:00,867 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-05 13:23:04,952 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-05 13:23:09,188 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-05 13:23:09,211 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-05 13:23:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:23:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-09-05 13:23:09,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:23:09,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:23:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:23:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=146, Unknown=6, NotChecked=78, Total=272 [2019-09-05 13:23:09,216 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2019-09-05 13:23:29,350 WARN L188 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-05 13:23:33,450 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-05 13:23:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:23:39,851 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-09-05 13:23:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:23:39,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-09-05 13:23:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:23:39,852 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:23:39,853 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:23:39,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=80, Invalid=264, Unknown=14, NotChecked=148, Total=506 [2019-09-05 13:23:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:23:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 13:23:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 13:23:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-05 13:23:39,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2019-09-05 13:23:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:23:39,860 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-05 13:23:39,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:23:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-05 13:23:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:23:39,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:23:39,862 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-05 13:23:39,863 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:23:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:23:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash -705610227, now seen corresponding path program 2 times [2019-09-05 13:23:39,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:23:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:23:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:23:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:23:39,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:23:39,869 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:23:39,869 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:23:39,869 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-05 13:23:39,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:23:39,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:23:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:23:39,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:23:39,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:23:39,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:23:39,922 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-05 13:23:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:23:39,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:23:40,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:23:40,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:23:40,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 13:23:40,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:23:40,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:23:40,255 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-05 13:23:40,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:24:09,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:24:26,370 WARN L188 SmtUtils]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-05 13:24:26,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:24:26,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:24:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:24:26,511 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-05 13:24:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 37 refuted. 9 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:24:28,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:24:28,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-09-05 13:24:28,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:24:28,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:24:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:24:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=363, Unknown=18, NotChecked=0, Total=462 [2019-09-05 13:24:28,919 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 22 states. [2019-09-05 13:24:31,443 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 19 [2019-09-05 13:24:44,190 WARN L188 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-09-05 13:24:54,930 WARN L188 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-09-05 13:25:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:11,385 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-05 13:25:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:25:11,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-09-05 13:25:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:11,386 INFO L225 Difference]: With dead ends: 37 [2019-09-05 13:25:11,386 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:25:11,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 71.9s TimeCoverageRelationStatistics Valid=172, Invalid=737, Unknown=21, NotChecked=0, Total=930 [2019-09-05 13:25:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:25:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:25:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:25:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:25:11,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-05 13:25:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:11,389 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:25:11,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:25:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:25:11,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:25:11,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:25:11 BoogieIcfgContainer [2019-09-05 13:25:11,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:25:11,395 INFO L168 Benchmark]: Toolchain (without parser) took 162101.51 ms. Allocated memory was 134.2 MB in the beginning and 257.9 MB in the end (delta: 123.7 MB). Free memory was 88.9 MB in the beginning and 206.6 MB in the end (delta: -117.7 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:25:11,395 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:25:11,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.78 ms. Allocated memory is still 134.2 MB. Free memory was 88.5 MB in the beginning and 78.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:25:11,397 INFO L168 Benchmark]: Boogie Preprocessor took 109.83 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 78.7 MB in the beginning and 177.8 MB in the end (delta: -99.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-05 13:25:11,398 INFO L168 Benchmark]: RCFGBuilder took 231.51 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 165.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:25:11,399 INFO L168 Benchmark]: TraceAbstraction took 161528.62 ms. Allocated memory was 201.3 MB in the beginning and 257.9 MB in the end (delta: 56.6 MB). Free memory was 165.9 MB in the beginning and 206.6 MB in the end (delta: -40.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-05 13:25:11,402 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.78 ms. Allocated memory is still 134.2 MB. Free memory was 88.5 MB in the beginning and 78.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.83 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 78.7 MB in the beginning and 177.8 MB in the end (delta: -99.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 231.51 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 165.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 161528.62 ms. Allocated memory was 201.3 MB in the beginning and 257.9 MB in the end (delta: 56.6 MB). Free memory was 165.9 MB in the beginning and 206.6 MB in the end (delta: -40.7 MB). Peak memory consumption was 15.9 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, 161.4s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 73.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 71 SDslu, 385 SDs, 0 SdLazy, 446 SolverSat, 54 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 111.1s 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, 87.0s 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...