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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/lcm2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:19:10,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:19:10,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:19:10,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:19:10,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:19:10,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:19:10,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:19:10,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:19:10,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:19:10,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:19:10,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:19:10,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:19:10,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:19:10,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:19:10,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:19:10,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:19:10,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:19:10,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:19:10,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:19:10,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:19:10,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:19:10,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:19:10,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:19:10,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:19:10,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:19:10,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:19:10,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:19:10,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:19:10,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:19:10,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:19:10,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:19:10,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:19:10,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:19:10,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:19:10,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:19:10,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:19:10,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:19:10,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:19:10,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:19:10,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:19:10,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:19:10,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 20:19:10,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:19:10,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:19:10,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:19:10,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:19:10,863 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:19:10,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:19:10,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:19:10,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:19:10,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:19:10,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:19:10,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:19:10,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:19:10,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:19:10,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:19:10,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:19:10,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:19:10,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:19:10,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:19:10,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:19:10,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:19:10,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:19:10,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:19:10,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:19:10,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:19:10,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:19:10,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:19:10,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:19:10,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:19:10,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:19:10,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:19:10,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:19:10,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:19:10,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:19:10,923 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:19:10,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm2.c [2019-09-03 20:19:10,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cbc45a/6460d967a4604a839ab8d65bbca5368c/FLAGc8d0778df [2019-09-03 20:19:11,433 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:19:11,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c [2019-09-03 20:19:11,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cbc45a/6460d967a4604a839ab8d65bbca5368c/FLAGc8d0778df [2019-09-03 20:19:11,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cbc45a/6460d967a4604a839ab8d65bbca5368c [2019-09-03 20:19:11,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:19:11,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:19:11,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:11,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:19:11,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:19:11,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:11" (1/1) ... [2019-09-03 20:19:11,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e5ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:11, skipping insertion in model container [2019-09-03 20:19:11,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:11" (1/1) ... [2019-09-03 20:19:11,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:19:11,902 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:19:12,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:12,104 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:19:12,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:12,155 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:19:12,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12 WrapperNode [2019-09-03 20:19:12,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:12,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:19:12,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:19:12,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:19:12,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... [2019-09-03 20:19:12,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:19:12,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:19:12,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:19:12,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:19:12,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:19:12,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:19:12,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:19:12,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:19:12,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:19:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:19:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:19:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:19:12,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:19:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:19:12,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:19:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:19:12,543 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:19:12,543 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:19:12,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:12 BoogieIcfgContainer [2019-09-03 20:19:12,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:19:12,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:19:12,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:19:12,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:19:12,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:19:11" (1/3) ... [2019-09-03 20:19:12,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89db33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:12, skipping insertion in model container [2019-09-03 20:19:12,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:12" (2/3) ... [2019-09-03 20:19:12,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89db33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:12, skipping insertion in model container [2019-09-03 20:19:12,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:12" (3/3) ... [2019-09-03 20:19:12,552 INFO L109 eAbstractionObserver]: Analyzing ICFG lcm2.c [2019-09-03 20:19:12,565 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:19:12,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:19:12,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:19:12,613 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:19:12,614 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:19:12,614 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:19:12,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:19:12,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:19:12,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:19:12,615 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:19:12,615 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:19:12,615 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:19:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 20:19:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:12,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:12,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:12,642 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash -858950785, now seen corresponding path program 1 times [2019-09-03 20:19:12,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:12,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:12,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:12,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:19:12,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:19:12,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:19:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:12,829 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-03 20:19:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:12,861 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-09-03 20:19:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:19:12,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:19:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:12,873 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:19:12,874 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:19:12,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:19:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:19:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:19:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 20:19:12,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-03 20:19:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:12,934 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 20:19:12,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:19:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 20:19:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:12,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:12,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:12,937 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -871939661, now seen corresponding path program 1 times [2019-09-03 20:19:12,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:12,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:12,959 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:12,960 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:12,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03 20:19:12,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:13,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:13,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:19:13,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:19:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:19:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:19:13,168 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2019-09-03 20:19:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,276 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-03 20:19:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:19:13,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:19:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,279 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:19:13,279 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:19:13,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:19:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:19:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:19:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:19:13,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-09-03 20:19:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,290 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:19:13,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:19:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:19:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:19:13,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,291 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,292 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 427538464, now seen corresponding path program 1 times [2019-09-03 20:19:13,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,301 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,301 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:13,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:13,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:13,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:19:13,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:13,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:13,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:13,468 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2019-09-03 20:19:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,566 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-03 20:19:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:13,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-03 20:19:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,568 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:19:13,568 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:19:13,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:19:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:19:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:19:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 20:19:13,576 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-03 20:19:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,577 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 20:19:13,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 20:19:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:19:13,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,578 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,579 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash 484796766, now seen corresponding path program 1 times [2019-09-03 20:19:13,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,593 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,593 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:13,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:13,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:19:13,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:13,715 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2019-09-03 20:19:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:13,817 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-09-03 20:19:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:13,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-03 20:19:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:13,822 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:19:13,822 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:19:13,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:19:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-03 20:19:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:19:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 20:19:13,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-03 20:19:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:13,836 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 20:19:13,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 20:19:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:13,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:13,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:13,839 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1597862285, now seen corresponding path program 2 times [2019-09-03 20:19:13,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:13,856 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:13,856 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:13,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:19:13,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:13,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:13,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:13,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:14,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:14,004 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-09-03 20:19:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:14,117 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-03 20:19:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:14,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-03 20:19:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:14,119 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:19:14,119 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:19:14,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:19:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-09-03 20:19:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:19:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:19:14,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-03 20:19:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:14,128 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:19:14,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:19:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:14,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:14,131 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:14,131 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1655120587, now seen corresponding path program 1 times [2019-09-03 20:19:14,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:14,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,142 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:14,144 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:14,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:14,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:14,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:14,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:14,283 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-03 20:19:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:14,425 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-03 20:19:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:14,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-03 20:19:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:14,428 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:19:14,429 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:19:14,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:19:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-09-03 20:19:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:19:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:19:14,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-03 20:19:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:14,445 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:19:14,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:19:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:14,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:14,447 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:14,447 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash 586745035, now seen corresponding path program 2 times [2019-09-03 20:19:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,463 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:14,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:14,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:14,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:19:14,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:14,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:14,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:14,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:14,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:14,609 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-03 20:19:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:14,743 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-09-03 20:19:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:14,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-03 20:19:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:14,744 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:19:14,745 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:19:14,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:19:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-09-03 20:19:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:19:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-03 20:19:14,754 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2019-09-03 20:19:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:14,754 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-03 20:19:14,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-03 20:19:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:14,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:14,755 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:14,756 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash 644003337, now seen corresponding path program 2 times [2019-09-03 20:19:14,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:14,762 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:14,762 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:14,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03 20:19:14,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:14,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:14,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:14,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:19:14,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:14,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:14,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:19:14,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:19:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:19:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:14,881 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 7 states. [2019-09-03 20:19:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:15,006 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2019-09-03 20:19:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:15,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-03 20:19:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:15,008 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:19:15,008 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:19:15,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:19:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-09-03 20:19:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:19:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:19:15,026 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2019-09-03 20:19:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:15,027 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:19:15,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:19:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:19:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:19:15,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:15,033 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:15,033 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -380015110, now seen corresponding path program 3 times [2019-09-03 20:19:15,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,041 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:15,041 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:15,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:15,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:19:15,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:19:15,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:15,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:19:15,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:19:15,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:15,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:19:15,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:19:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:19:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:19:15,179 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 8 states. [2019-09-03 20:19:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:15,281 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-03 20:19:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:19:15,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-03 20:19:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:15,283 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:19:15,283 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:19:15,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:19:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-09-03 20:19:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:19:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-03 20:19:15,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2019-09-03 20:19:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:15,301 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-03 20:19:15,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:19:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-03 20:19:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:19:15,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:15,303 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:15,303 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -322756808, now seen corresponding path program 3 times [2019-09-03 20:19:15,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:15,315 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:15,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-03 20:19:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:19:15,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:19:15,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:15,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:19:15,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:15,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-03 20:19:15,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:15,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:19:15,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:19:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:19:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:19:15,456 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 9 states. [2019-09-03 20:19:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:15,583 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-09-03 20:19:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:19:15,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-03 20:19:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:15,585 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:19:15,585 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:19:15,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:19:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:19:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2019-09-03 20:19:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:19:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-03 20:19:15,602 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2019-09-03 20:19:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:15,605 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-03 20:19:15,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:19:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-03 20:19:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:19:15,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:15,606 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:15,606 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1391132360, now seen corresponding path program 4 times [2019-09-03 20:19:15,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:15,618 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:15,619 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:15,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:19:15,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:19:15,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:15,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:19:15,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:19,807 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-03 20:19:28,068 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-03 20:19:40,203 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-03 20:19:40,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 8 refuted. 8 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:19:40,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:40,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:19:40,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:19:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:19:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=75, Unknown=11, NotChecked=0, Total=110 [2019-09-03 20:19:40,310 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 11 states. [2019-09-03 20:20:44,172 WARN L188 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-03 20:21:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:28,742 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-09-03 20:21:28,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:21:28,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-09-03 20:21:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:28,744 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:21:28,745 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:21:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=41, Invalid=126, Unknown=15, NotChecked=0, Total=182 [2019-09-03 20:21:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:21:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-03 20:21:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:21:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-09-03 20:21:28,763 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 34 [2019-09-03 20:21:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:28,764 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-09-03 20:21:28,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:21:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-09-03 20:21:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:21:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:28,766 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:28,767 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1333874058, now seen corresponding path program 5 times [2019-09-03 20:21:28,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:28,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:28,773 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:28,773 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:28,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03 20:21:28,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:21:28,819 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 20:21:28,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:28,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:21:28,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:28,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:21:28,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:28,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:21:28,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:21:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:21:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:21:28,984 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 8 states. [2019-09-03 20:21:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:29,197 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-09-03 20:21:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:21:29,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-03 20:21:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:29,205 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:21:29,205 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:21:29,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:21:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:21:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-03 20:21:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:21:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-09-03 20:21:29,247 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 34 [2019-09-03 20:21:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:29,248 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-09-03 20:21:29,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:21:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-09-03 20:21:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:21:29,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:29,257 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:29,257 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -161160392, now seen corresponding path program 6 times [2019-09-03 20:21:29,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:29,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:29,268 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:29,268 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:29,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:21:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:21:29,326 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-03 20:21:29,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:29,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:21:29,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-03 20:21:29,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:29,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:21:29,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:21:29,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:21:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:21:29,481 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 9 states. [2019-09-03 20:21:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:30,647 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-09-03 20:21:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:21:30,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-03 20:21:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:30,648 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:21:30,649 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:21:30,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:21:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:21:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2019-09-03 20:21:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:21:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-09-03 20:21:30,665 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 34 [2019-09-03 20:21:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:30,665 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-09-03 20:21:30,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:21:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-09-03 20:21:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:21:30,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:30,667 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:30,667 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1172277642, now seen corresponding path program 7 times [2019-09-03 20:21:30,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:30,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:30,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:30,673 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:30,673 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:30,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:21:30,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:21:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:21:30,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:21:30,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:21:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:21:30,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:21:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:21:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:21:30,836 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 8 states. [2019-09-03 20:21:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:31,005 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2019-09-03 20:21:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:21:31,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-03 20:21:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:31,007 INFO L225 Difference]: With dead ends: 108 [2019-09-03 20:21:31,007 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:21:31,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:21:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:21:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2019-09-03 20:21:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 20:21:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2019-09-03 20:21:31,022 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 34 [2019-09-03 20:21:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:31,022 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2019-09-03 20:21:31,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:21:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2019-09-03 20:21:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:21:31,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:31,024 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:31,024 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1115019340, now seen corresponding path program 3 times [2019-09-03 20:21:31,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:31,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:21:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,029 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:31,029 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:31,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:21:31,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:21:31,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:21:31,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:31,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:21:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:31,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:21:31,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:21:31,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:21:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:21:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:21:31,162 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 8 states. [2019-09-03 20:21:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:31,250 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2019-09-03 20:21:31,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:21:31,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-09-03 20:21:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:31,252 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:21:31,252 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:21:31,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:21:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:21:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-09-03 20:21:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:21:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2019-09-03 20:21:31,271 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 34 [2019-09-03 20:21:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:31,272 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2019-09-03 20:21:31,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:21:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2019-09-03 20:21:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:21:31,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:31,274 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:31,275 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1845621219, now seen corresponding path program 8 times [2019-09-03 20:21:31,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:31,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:31,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,282 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:31,282 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:31,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-03 20:21:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:21:31,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:21:31,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:31,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:21:31,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:21:31,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:31,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:21:31,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:21:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:21:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:21:31,510 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 9 states. [2019-09-03 20:21:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:31,698 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2019-09-03 20:21:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:21:31,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-03 20:21:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:31,700 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:21:31,700 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 20:21:31,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:21:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 20:21:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2019-09-03 20:21:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 20:21:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-09-03 20:21:31,715 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 42 [2019-09-03 20:21:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:31,715 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-09-03 20:21:31,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:21:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-09-03 20:21:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:21:31,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:21:31,717 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:21:31,717 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:21:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:21:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1276632411, now seen corresponding path program 9 times [2019-09-03 20:21:31,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:21:31,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:21:31,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:21:31,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:21:31,722 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:21:31,722 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:21:31,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:21:31,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:21:31,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:21:31,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:21:31,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:21:31,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:21:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:21:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-03 20:21:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:21:31,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:21:31,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:21:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:21:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:21:31,820 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 8 states. [2019-09-03 20:21:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:21:31,869 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-09-03 20:21:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:21:31,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-09-03 20:21:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:21:31,870 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:21:31,870 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:21:31,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:21:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:21:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:21:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:21:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:21:31,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-09-03 20:21:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:21:31,873 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:21:31,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:21:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:21:31,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:21:31,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:22:38,850 WARN L188 SmtUtils]: Spent 1.11 m on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-03 20:24:33,946 WARN L188 SmtUtils]: Spent 1.92 m on a formula simplification. DAG size of input: 100 DAG size of output: 48 [2019-09-03 20:25:44,800 WARN L188 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-03 20:25:44,802 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:25:44,802 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:25:44,802 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:25:44,802 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:25:44,802 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:25:44,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:25:44,803 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= 1 main_~a~0)) (.cse1 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0))))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (= (* main_~b~0 (* 2 main_~a~0)) (+ (* v_prenex_1 (+ (* (- 1) main_~v~0) main_~u~0)) (* (+ (* 2 main_~v~0) (* (- 1) main_~u~0)) (+ main_~x~0 main_~y~0)))))) (and .cse0 .cse1 (exists ((main_~x~0 Int)) (= (+ (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0))) (* main_~x~0 main_~u~0)) (* main_~b~0 (* 2 main_~a~0))))) (and .cse0 (= main_~a~0 main_~v~0) .cse1 (= main_~a~0 main_~x~0)))) [2019-09-03 20:25:44,803 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 26 39) no Hoare annotation was computed. [2019-09-03 20:25:44,803 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 46) no Hoare annotation was computed. [2019-09-03 20:25:44,803 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 46) no Hoare annotation was computed. [2019-09-03 20:25:44,803 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 38) no Hoare annotation was computed. [2019-09-03 20:25:44,803 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 26 39) the Hoare annotation is: (let ((.cse0 (<= 1 main_~a~0)) (.cse1 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0))))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (= (* main_~b~0 (* 2 main_~a~0)) (+ (* v_prenex_1 (+ (* (- 1) main_~v~0) main_~u~0)) (* (+ (* 2 main_~v~0) (* (- 1) main_~u~0)) (+ main_~x~0 main_~y~0)))))) (and .cse0 .cse1 (exists ((main_~x~0 Int)) (= (+ (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0))) (* main_~x~0 main_~u~0)) (* main_~b~0 (* 2 main_~a~0))))) (and .cse0 (= main_~a~0 main_~v~0) .cse1 (= main_~a~0 main_~x~0)))) [2019-09-03 20:25:44,803 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 46) the Hoare annotation is: true [2019-09-03 20:25:44,804 INFO L439 ceAbstractionStarter]: At program point L26-2(lines 26 39) the Hoare annotation is: (let ((.cse0 (* main_~b~0 (* 2 main_~a~0)))) (let ((.cse2 (<= 1 main_~a~0)) (.cse1 (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) .cse0))) (or (and (= (+ (* main_~x~0 (+ (* (- 1) main_~v~0) main_~u~0)) (* main_~v~0 (+ main_~x~0 main_~y~0))) .cse0) (exists ((v_prenex_1 Int)) (= (* main_~b~0 (* 2 main_~a~0)) (+ (* v_prenex_1 (+ (* (- 1) main_~v~0) main_~u~0)) (* (+ (* 2 main_~v~0) (* (- 1) main_~u~0)) (+ main_~x~0 main_~y~0)))))) (and (exists ((v_prenex_1 Int)) (= (+ (* main_~u~0 v_prenex_1) (* main_~y~0 (+ main_~v~0 (* (- 1) main_~u~0)))) (* main_~b~0 (* 2 main_~a~0)))) .cse1) (and .cse2 (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) .cse1) (and .cse2 (= main_~a~0 main_~v~0) (exists ((main_~x~0 Int)) (= (+ (* main_~x~0 main_~u~0) (* main_~y~0 main_~v~0)) (* main_~b~0 (* 2 main_~a~0)))) .cse1 (= main_~a~0 main_~x~0))))) [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-09-03 20:25:44,804 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-03 20:25:44,804 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:25:44,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-03 20:25:44,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-03 20:25:44,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-03 20:25:44,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-03 20:25:44,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:25:44 BoogieIcfgContainer [2019-09-03 20:25:44,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:25:44,823 INFO L168 Benchmark]: Toolchain (without parser) took 392953.46 ms. Allocated memory was 138.4 MB in the beginning and 320.9 MB in the end (delta: 182.5 MB). Free memory was 85.8 MB in the beginning and 152.5 MB in the end (delta: -66.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,824 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.42 ms. Allocated memory is still 138.4 MB. Free memory was 85.5 MB in the beginning and 76.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,826 INFO L168 Benchmark]: Boogie Preprocessor took 133.92 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 76.1 MB in the beginning and 174.7 MB in the end (delta: -98.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,827 INFO L168 Benchmark]: RCFGBuilder took 253.68 ms. Allocated memory is still 197.7 MB. Free memory was 174.7 MB in the beginning and 163.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,828 INFO L168 Benchmark]: TraceAbstraction took 392276.35 ms. Allocated memory was 197.7 MB in the beginning and 320.9 MB in the end (delta: 123.2 MB). Free memory was 162.7 MB in the beginning and 152.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:25:44,832 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.42 ms. Allocated memory is still 138.4 MB. Free memory was 85.5 MB in the beginning and 76.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.92 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 76.1 MB in the beginning and 174.7 MB in the end (delta: -98.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 253.68 ms. Allocated memory is still 197.7 MB. Free memory was 174.7 MB in the beginning and 163.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 392276.35 ms. Allocated memory was 197.7 MB in the beginning and 320.9 MB in the end (delta: 123.2 MB). Free memory was 162.7 MB in the beginning and 152.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2019-09-03 20:25:44,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-03 20:25:44,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2019-09-03 20:25:44,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-09-03 20:25:44,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] Derived loop invariant: (((1 <= a && x * u + y * v == b * (2 * a)) && (\exists v_prenex_1 : int :: b * (2 * a) == v_prenex_1 * (-1 * v + u) + (2 * v + -1 * u) * (x + y))) || ((1 <= a && x * u + y * v == b * (2 * a)) && (\exists main_~x~0 : int :: y * (v + -1 * u) + main_~x~0 * u == b * (2 * a)))) || (((1 <= a && a == v) && x * u + y * v == b * (2 * a)) && a == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 392.1s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 111.4s AutomataDifference, 0.0s DeadEndRemovalTime, 252.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 151 SDslu, 1019 SDs, 0 SdLazy, 1308 SolverSat, 58 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 80.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 363 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 56.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 116 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 36 PreInvPairs, 77 NumberOfFragments, 348 HoareAnnotationTreeSize, 36 FomulaSimplifications, 8208 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 309 FormulaSimplificationTreeSizeReductionInter, 252.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 482 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 465 ConstructedInterpolants, 12 QuantifiedInterpolants, 120113 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 386 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 311/452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...