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/divbin.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:20:00,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:20:00,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:20:00,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:20:00,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:20:00,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:20:00,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:20:00,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:20:00,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:20:00,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:20:00,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:20:00,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:20:00,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:20:00,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:20:00,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:20:00,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:20:00,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:20:00,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:20:00,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:20:00,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:20:00,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:20:00,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:20:00,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:20:00,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:20:00,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:20:00,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:20:00,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:20:00,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:20:00,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:20:00,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:20:00,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:20:00,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:20:00,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:20:00,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:20:00,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:20:00,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:20:00,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:20:00,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:20:00,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:20:00,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:20:00,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:20:00,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:20:00,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:20:00,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:20:00,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:20:00,927 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:20:00,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:20:00,928 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:20:00,928 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:20:00,928 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:20:00,928 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:20:00,929 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:20:00,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:20:00,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:20:00,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:20:00,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:20:00,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:20:00,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:20:00,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:20:00,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:20:00,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:20:00,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:20:00,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:20:00,931 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:20:00,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:20:00,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:20:00,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:20:00,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:20:00,932 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:20:00,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:20:00,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:20:00,933 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:20:00,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:20:00,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:20:00,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:20:00,983 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:20:00,984 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:20:00,984 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-10 02:20:01,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7e8c3d6/ead38b1024ee44c2af12b1909649cb90/FLAG22ea3ef07 [2019-09-10 02:20:01,502 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:20:01,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-10 02:20:01,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7e8c3d6/ead38b1024ee44c2af12b1909649cb90/FLAG22ea3ef07 [2019-09-10 02:20:01,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7e8c3d6/ead38b1024ee44c2af12b1909649cb90 [2019-09-10 02:20:01,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:20:01,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:20:01,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:20:01,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:20:01,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:20:01,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:20:01" (1/1) ... [2019-09-10 02:20:01,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b80efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:01, skipping insertion in model container [2019-09-10 02:20:01,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:20:01" (1/1) ... [2019-09-10 02:20:01,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:20:01,904 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:20:02,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:20:02,052 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:20:02,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:20:02,085 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:20:02,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02 WrapperNode [2019-09-10 02:20:02,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:20:02,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:20:02,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:20:02,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:20:02,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... [2019-09-10 02:20:02,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:20:02,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:20:02,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:20:02,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:20:02,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:20:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:20:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:20:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:20:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:20:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:20:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:20:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:20:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:20:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:20:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:20:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:20:02,462 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:20:02,462 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 02:20:02,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:20:02 BoogieIcfgContainer [2019-09-10 02:20:02,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:20:02,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:20:02,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:20:02,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:20:02,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:20:01" (1/3) ... [2019-09-10 02:20:02,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f43560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:20:02, skipping insertion in model container [2019-09-10 02:20:02,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:20:02" (2/3) ... [2019-09-10 02:20:02,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f43560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:20:02, skipping insertion in model container [2019-09-10 02:20:02,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:20:02" (3/3) ... [2019-09-10 02:20:02,481 INFO L109 eAbstractionObserver]: Analyzing ICFG divbin.c [2019-09-10 02:20:02,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:20:02,517 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:20:02,539 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:20:02,594 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:20:02,595 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:20:02,595 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:20:02,595 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:20:02,595 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:20:02,595 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:20:02,596 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:20:02,596 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:20:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-10 02:20:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:20:02,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:02,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:02,621 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash -783376379, now seen corresponding path program 1 times [2019-09-10 02:20:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:02,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:02,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:20:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:20:02,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:20:02,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:20:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:20:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:20:02,759 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-10 02:20:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:02,774 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-09-10 02:20:02,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:20:02,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-10 02:20:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:02,783 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:20:02,783 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 02:20:02,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:20:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 02:20:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 02:20:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 02:20:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-09-10 02:20:02,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2019-09-10 02:20:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:02,819 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-09-10 02:20:02,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:20:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-09-10 02:20:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:20:02,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:02,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:02,821 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1238212304, now seen corresponding path program 1 times [2019-09-10 02:20:02,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:02,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:02,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:02,831 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:02,831 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:02,831 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:02,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:02,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:20:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:02,871 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 02:20:02,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:02,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:02,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:02,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:20:02,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:02,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:20:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-10 02:20:03,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:20:03,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:20:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:20:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:20:03,057 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-09-10 02:20:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:03,162 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-09-10 02:20:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:20:03,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-10 02:20:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:03,164 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:20:03,164 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:20:03,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:20:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:20:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 02:20:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 02:20:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 02:20:03,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2019-09-10 02:20:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:03,179 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 02:20:03,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:20:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 02:20:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:20:03,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:03,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:03,182 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1076826781, now seen corresponding path program 1 times [2019-09-10 02:20:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:03,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:03,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:03,204 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:03,205 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:03,205 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:20:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:03,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-10 02:20:03,238 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-10 02:20:03,274 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:20:03,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:20:03,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:20:03,388 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 20 root evaluator evaluations with a maximum evaluation depth of 8. Performed 20 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 7 variables. [2019-09-10 02:20:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:03,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:20:03,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:03,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:03,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:03,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 02:20:03,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:03,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:20:03,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-10 02:20:03,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:20:03,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:20:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:20:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:20:03,467 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-10 02:20:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:03,483 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-10 02:20:03,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:20:03,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-10 02:20:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:03,488 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:20:03,488 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:20:03,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:20:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:20:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 02:20:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:20:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 02:20:03,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-09-10 02:20:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:03,505 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 02:20:03,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:20:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 02:20:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:20:03,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:03,508 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:03,508 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1643387496, now seen corresponding path program 1 times [2019-09-10 02:20:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:03,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:03,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:03,535 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:03,536 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:03,536 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-10 02:20:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,554 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-10 02:20:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:03,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-10 02:20:03,573 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-10 02:20:03,581 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:20:03,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:20:03,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:20:03,668 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-10 02:20:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:03,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:20:03,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:03,669 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-10 02:20:03,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:03,692 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-10 02:20:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:03,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:20:03,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:20:03,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:20:03,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:20:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-10 02:20:03,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:03,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:20:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:20:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:20:03,878 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 9 states. [2019-09-10 02:20:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:03,999 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-09-10 02:20:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:20:04,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 02:20:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:04,001 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:20:04,001 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:20:04,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:20:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:20:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:20:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:20:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:20:04,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-09-10 02:20:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:04,011 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:20:04,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:20:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:20:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:20:04,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:04,016 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:04,016 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1005474043, now seen corresponding path program 2 times [2019-09-10 02:20:04,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:04,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:04,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:04,031 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:04,031 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:04,031 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) [2019-09-10 02:20:04,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:04,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:04,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:04,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:04,065 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) [2019-09-10 02:20:04,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:20:04,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:04,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:20:04,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:04,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:20:04,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:20:04,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:20:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:20:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-10 02:20:04,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:04,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:20:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:20:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:20:04,229 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-10 02:20:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:04,288 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-10 02:20:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:20:04,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-10 02:20:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:04,290 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:20:04,290 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:20:04,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:20:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:20:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 02:20:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:20:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-10 02:20:04,304 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2019-09-10 02:20:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:04,304 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-10 02:20:04,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:20:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-10 02:20:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:20:04,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:04,307 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:04,307 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 365642816, now seen corresponding path program 3 times [2019-09-10 02:20:04,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:04,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:04,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:04,326 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:04,326 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:04,326 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:04,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:04,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:20:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:04,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:04,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:04,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:04,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:04,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:20:04,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:20:04,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:20:04,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:04,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:20:04,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:05,098 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-10 02:20:05,137 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~b~0_32 Int)) (let ((.cse1 (+ c_main_~b~0 c_main_~r~0)) (.cse0 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (<= .cse0 .cse1) (= (+ .cse1 (* (div (+ (* (- 1) c_main_~q~0) 1) (- 2)) v_main_~b~0_32)) c_main_~A~0) (= (div v_main_~b~0_32 2) c_main_~b~0) (< .cse1 v_main_~b~0_32) (= (mod .cse0 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))) (= (mod (+ c_main_~q~0 1) (- 2)) 0)) is different from false [2019-09-10 02:20:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:05,306 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (+ (div (- c_main_~q~0) (- 2)) 1) (- 2)) 0)) (.cse1 (= (mod c_main_~q~0 (- 2)) 0))) (or (and .cse0 .cse1 (exists ((v_main_~b~0_32 Int)) (let ((.cse3 (div v_main_~b~0_32 2))) (let ((.cse2 (+ .cse3 c_main_~r~0)) (.cse4 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse2 v_main_~b~0_32) (= c_main_~b~0 (div .cse3 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse2) c_main_~A~0) (<= .cse4 .cse2) (= (mod .cse3 2) 0) (= (mod .cse4 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))))) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse6 (div v_main_~b~0_32 2))) (let ((.cse5 (+ .cse6 c_main_~r~0)) (.cse7 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse5 v_main_~b~0_32) (= c_main_~b~0 (div .cse6 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse5) c_main_~A~0) (<= .cse7 .cse5) (= (mod .cse7 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (<= 0 .cse6))))) .cse1) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse8 (div v_main_~b~0_32 2))) (let ((.cse9 (+ .cse8 c_main_~r~0)) (.cse10 (div (- v_main_~b~0_32) (- 2)))) (and (not (= (mod .cse8 2) 0)) (<= 0 v_main_~b~0_32) (< .cse9 v_main_~b~0_32) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse9) c_main_~A~0) (<= .cse10 .cse9) (< .cse8 0) (= (mod .cse10 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (= c_main_~b~0 (+ (div .cse8 2) 1)))))) .cse1))) is different from false [2019-09-10 02:20:17,950 WARN L188 SmtUtils]: Spent 12.58 s on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2019-09-10 02:20:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2019-09-10 02:20:18,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:20,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:20,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:20,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:21,754 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 02:20:21,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 02:20:21,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:21,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:21,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:22,037 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 9 [2019-09-10 02:20:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:20:22,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:20:22,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-09-10 02:20:22,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:22,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:20:22,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:20:22,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=343, Unknown=7, NotChecked=78, Total=506 [2019-09-10 02:20:22,531 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 23 states. [2019-09-10 02:20:34,631 WARN L188 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 02:20:51,632 WARN L188 SmtUtils]: Spent 14.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 02:20:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:53,421 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-09-10 02:20:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:20:53,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-09-10 02:20:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:53,430 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:20:53,430 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:20:53,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=109, Invalid=538, Unknown=11, NotChecked=98, Total=756 [2019-09-10 02:20:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:20:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-09-10 02:20:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 02:20:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-10 02:20:53,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2019-09-10 02:20:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:53,441 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-10 02:20:53,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:20:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-10 02:20:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:20:53,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:53,445 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:53,446 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash 836866802, now seen corresponding path program 1 times [2019-09-10 02:20:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:53,460 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:53,460 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:53,460 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:20:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2019-09-10 02:20:53,500 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [33], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65] [2019-09-10 02:20:53,502 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:20:53,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:20:53,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:20:53,533 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-10 02:20:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:53,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:20:53,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:53,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:20:53,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:20:53,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:53,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:20:53,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:20:53,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-10 02:20:53,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:53,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:20:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:20:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:20:53,693 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2019-09-10 02:20:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:53,779 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-09-10 02:20:53,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:20:53,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-10 02:20:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:53,782 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:20:53,782 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:20:53,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:20:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:20:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 02:20:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:20:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-10 02:20:53,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 38 [2019-09-10 02:20:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:53,793 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-10 02:20:53,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:20:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-10 02:20:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:20:53,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:53,795 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:53,795 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:53,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2054940077, now seen corresponding path program 4 times [2019-09-10 02:20:53,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:53,811 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:53,813 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:53,813 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 02:20:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:53,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:53,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:53,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:20:53,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:20:53,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:20:53,941 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:54,315 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-10 02:20:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:20:54,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:20:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-10 02:20:54,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:54,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:20:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:20:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:20:54,358 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2019-09-10 02:20:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:54,452 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-10 02:20:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:20:54,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-10 02:20:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:54,454 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:20:54,454 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:20:54,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:20:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:20:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 02:20:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:20:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-09-10 02:20:54,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 40 [2019-09-10 02:20:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:54,460 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-09-10 02:20:54,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:20:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-09-10 02:20:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:20:54,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:54,462 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:54,462 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 632581416, now seen corresponding path program 5 times [2019-09-10 02:20:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:54,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:54,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:20:54,470 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:20:54,470 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:20:54,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:54,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:20:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:54,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:54,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:54,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:54,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:54,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:20:54,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:20:54,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:20:54,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:54,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:20:54,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:54,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:54,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:57,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:57,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:20:57,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:58,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:58,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:20:58,970 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 02:20:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:01,635 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-09-10 02:21:02,257 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-09-10 02:21:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:21:02,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:21:02,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-10 02:21:02,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:02,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:21:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:21:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2019-09-10 02:21:02,640 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 25 states. [2019-09-10 02:21:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:12,876 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-09-10 02:21:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:21:12,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-09-10 02:21:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:12,880 INFO L225 Difference]: With dead ends: 64 [2019-09-10 02:21:12,880 INFO L226 Difference]: Without dead ends: 64 [2019-09-10 02:21:12,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=110, Invalid=538, Unknown=2, NotChecked=0, Total=650 [2019-09-10 02:21:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-10 02:21:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-09-10 02:21:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:21:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-10 02:21:12,889 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 42 [2019-09-10 02:21:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:12,890 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-10 02:21:12,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:21:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-10 02:21:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 02:21:12,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:12,891 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:12,891 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1597921643, now seen corresponding path program 6 times [2019-09-10 02:21:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:12,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:12,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:12,899 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:21:12,899 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:21:12,899 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:21:12,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:12,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:21:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:12,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:12,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:12,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:12,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:12,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:21:12,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:21:12,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:21:12,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:21:12,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:21:12,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:21:13,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:13,508 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-10 02:21:13,898 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-10 02:21:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:21:14,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:21:14,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-10 02:21:14,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:14,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:21:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:21:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:21:14,140 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 17 states. [2019-09-10 02:21:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:21:14,424 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-09-10 02:21:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:21:14,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2019-09-10 02:21:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:21:14,426 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:21:14,426 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 02:21:14,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:21:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 02:21:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-10 02:21:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:21:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-10 02:21:14,432 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2019-09-10 02:21:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:21:14,432 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-10 02:21:14,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:21:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-10 02:21:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:21:14,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:21:14,434 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:21:14,434 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:21:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:21:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -903917488, now seen corresponding path program 7 times [2019-09-10 02:21:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:21:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:14,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:21:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:21:14,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:21:14,441 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:21:14,442 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:21:14,442 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:21:14,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:14,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:21:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:14,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:21:14,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:21:14,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:21:14,486 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:21:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:21:14,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:21:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:21:14,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-10 02:21:14,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:21:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,362 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 02:21:19,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:21:19,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:21:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:19,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:20,327 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 02:21:20,822 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 02:21:20,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 02:21:20,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:20,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:20,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:20,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:20,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:23,606 WARN L188 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-09-10 02:21:24,943 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 02:21:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:21:37,213 WARN L188 SmtUtils]: Spent 11.08 s on a formula simplification. DAG size of input: 198 DAG size of output: 187 [2019-09-10 02:21:40,567 WARN L188 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 188 DAG size of output: 100 [2019-09-10 02:21:42,449 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2019-09-10 02:21:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:21:42,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:21:42,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-09-10 02:21:42,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:21:42,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:21:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:21:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=778, Unknown=2, NotChecked=0, Total=930 [2019-09-10 02:21:42,826 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 31 states. [2019-09-10 02:22:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:00,475 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-10 02:22:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:22:00,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2019-09-10 02:22:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:00,477 INFO L225 Difference]: With dead ends: 81 [2019-09-10 02:22:00,477 INFO L226 Difference]: Without dead ends: 81 [2019-09-10 02:22:00,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=171, Invalid=883, Unknown=2, NotChecked=0, Total=1056 [2019-09-10 02:22:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-10 02:22:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-09-10 02:22:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:22:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-09-10 02:22:00,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 52 [2019-09-10 02:22:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:00,487 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-09-10 02:22:00,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:22:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-09-10 02:22:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 02:22:00,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:00,488 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:00,488 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash 340451773, now seen corresponding path program 8 times [2019-09-10 02:22:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:00,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:00,496 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:22:00,496 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:22:00,496 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:22:00,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:00,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:22:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:00,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:00,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:00,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:00,549 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:00,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:22:00,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:22:00,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:22:00,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:22:00,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:22:00,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:22:00,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:01,417 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-10 02:22:01,841 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-10 02:22:02,588 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-10 02:22:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:22:02,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:22:02,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-10 02:22:02,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:02,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:22:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:22:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:22:02,725 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 12 states. [2019-09-10 02:22:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:02,979 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2019-09-10 02:22:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:22:02,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-10 02:22:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:02,980 INFO L225 Difference]: With dead ends: 84 [2019-09-10 02:22:02,980 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 02:22:02,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:22:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 02:22:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-10 02:22:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:22:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-09-10 02:22:02,987 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 60 [2019-09-10 02:22:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:02,987 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-09-10 02:22:02,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:22:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-09-10 02:22:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 02:22:02,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:02,989 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:02,989 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1434985032, now seen corresponding path program 9 times [2019-09-10 02:22:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:02,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:02,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:02,996 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 02:22:02,997 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 02:22:02,997 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 02:22:03,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:03,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 02:22:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:03,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:03,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:03,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:03,066 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:03,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:22:03,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:22:03,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:22:03,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:22:03,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 02:22:03,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:04,260 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-10 02:22:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:12,333 WARN L188 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 02:22:14,342 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 02:22:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:30,711 WARN L188 SmtUtils]: Spent 14.23 s on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 02:22:30,982 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~b~0_120 Int)) (let ((.cse3 (div (- v_main_~b~0_120) (- 2)))) (let ((.cse0 (div v_main_~b~0_120 2)) (.cse2 (div (- .cse3) (- 2)))) (let ((.cse1 (div (- .cse2) (- 2))) (.cse4 (+ c_main_~b~0 c_main_~r~0 .cse0))) (and (= c_main_~b~0 (div .cse0 2)) (= 0 (mod (div (- .cse1) (- 2)) (- 2))) (= 0 (mod .cse2 (- 2))) (= 0 (mod v_main_~b~0_120 2)) (<= 0 .cse0) (= 0 (mod .cse1 (- 2))) (= (mod v_main_~b~0_120 (- 2)) 0) (<= .cse3 .cse4) (< .cse4 v_main_~b~0_120) (= c_main_~A~0 (+ .cse4 (* v_main_~b~0_120 (div (+ (div (+ c_main_~q~0 (- 1)) 2) (- 1)) 2)))) (= (mod .cse3 (- 2)) 0)))))) (= 0 (mod (+ c_main_~q~0 1) 2)) (= 0 (mod (+ (div (+ c_main_~q~0 (- 1)) 2) 1) 2))) is different from false [2019-09-10 02:22:31,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:31,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:39,165 WARN L188 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 02:22:41,739 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-10 02:22:41,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:22:52,713 WARN L188 SmtUtils]: Spent 10.57 s on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 02:23:00,074 WARN L188 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-10 02:23:00,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:00,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:06,212 WARN L188 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 02:23:10,404 WARN L188 SmtUtils]: Spent 2.79 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-10 02:23:10,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 46 refuted. 3 times theorem prover too weak. 28 trivial. 14 not checked. [2019-09-10 02:23:15,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:23:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:43,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:43,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:43,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:43,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:43,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:51,782 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 02:23:59,086 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 02:23:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 02:23:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:23:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:04,950 WARN L188 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 02:24:11,891 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 96 [2019-09-10 02:24:11,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-09-10 02:24:11,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:11,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:27,946 WARN L188 SmtUtils]: Spent 11.68 s on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2019-09-10 02:24:39,038 WARN L188 SmtUtils]: Spent 7.44 s on a formula simplification that was a NOOP. DAG size: 182 [2019-09-10 02:24:39,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 17 terms [2019-09-10 02:24:39,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:24:39,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,423 WARN L188 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 369 DAG size of output: 344 [2019-09-10 02:26:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 33 terms [2019-09-10 02:26:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:26:19,643 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 414 DAG size of output: 25 [2019-09-10 02:26:19,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:27:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 19 proven. 71 refuted. 12 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:27:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:27:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2019-09-10 02:27:39,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:39,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:27:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:27:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1282, Unknown=90, NotChecked=76, Total=1640 [2019-09-10 02:27:39,740 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 41 states. [2019-09-10 02:27:47,637 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 10 [2019-09-10 02:27:52,626 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 67 DAG size of output: 14 [2019-09-10 02:28:03,588 WARN L188 SmtUtils]: Spent 9.43 s on a formula simplification. DAG size of input: 90 DAG size of output: 46 [2019-09-10 02:28:12,468 WARN L188 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 95 [2019-09-10 02:28:22,086 WARN L188 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 02:28:43,299 WARN L188 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 02:28:55,674 WARN L188 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 02:29:06,840 WARN L188 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 02:29:36,418 WARN L188 SmtUtils]: Spent 14.32 s on a formula simplification. DAG size of input: 174 DAG size of output: 48 [2019-09-10 02:30:04,358 WARN L188 SmtUtils]: Spent 12.41 s on a formula simplification. DAG size of input: 253 DAG size of output: 53 [2019-09-10 02:30:21,573 WARN L188 SmtUtils]: Spent 9.40 s on a formula simplification. DAG size of input: 188 DAG size of output: 48 [2019-09-10 02:30:37,039 WARN L188 SmtUtils]: Spent 13.27 s on a formula simplification. DAG size of input: 300 DAG size of output: 53 [2019-09-10 02:30:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:30:38,194 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-10 02:30:38,198 INFO L168 Benchmark]: Toolchain (without parser) took 636327.56 ms. Allocated memory was 134.7 MB in the beginning and 234.9 MB in the end (delta: 100.1 MB). Free memory was 91.2 MB in the beginning and 82.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,199 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.56 ms. Allocated memory is still 134.7 MB. Free memory was 91.0 MB in the beginning and 81.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,200 INFO L168 Benchmark]: Boogie Preprocessor took 123.42 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 81.7 MB in the beginning and 176.4 MB in the end (delta: -94.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,201 INFO L168 Benchmark]: RCFGBuilder took 254.17 ms. Allocated memory is still 199.8 MB. Free memory was 176.4 MB in the beginning and 164.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,202 INFO L168 Benchmark]: TraceAbstraction took 635731.16 ms. Allocated memory was 199.8 MB in the beginning and 234.9 MB in the end (delta: 35.1 MB). Free memory was 164.3 MB in the beginning and 82.3 MB in the end (delta: 81.9 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:38,205 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.7 MB. Free memory was 109.4 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 214.56 ms. Allocated memory is still 134.7 MB. Free memory was 91.0 MB in the beginning and 81.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.42 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 81.7 MB in the beginning and 176.4 MB in the end (delta: -94.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 254.17 ms. Allocated memory is still 199.8 MB. Free memory was 176.4 MB in the beginning and 164.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 635731.16 ms. Allocated memory was 199.8 MB in the beginning and 234.9 MB in the end (delta: 35.1 MB). Free memory was 164.3 MB in the beginning and 82.3 MB in the end (delta: 81.9 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...